Solve the following minimization problem by maximizing the dual problem: Minimize C = 2 x 1 + 3 x 2 subject to x 1 − 2 x 2 ≥ 2 − x 1 + x 2 ≥ 1 x 1 , x 2 ≥ 0
Solve the following minimization problem by maximizing the dual problem: Minimize C = 2 x 1 + 3 x 2 subject to x 1 − 2 x 2 ≥ 2 − x 1 + x 2 ≥ 1 x 1 , x 2 ≥ 0
Solution Summary: The author explains that the optimal solution of the minimization problem cannot be determined through simplex tableau.
Consider the following optimization problem:
Determine three positive real numbers such that their product is 237 and
such that the sum of squares of these numbers is minimum.
The above problem can be solved by optimizing the following objective
function:
xty? + x?yt + 237
A) S(x, y)
x*y? + x?yt + 2372
x2 + y?
B) S(x, y)
C) S(x, y) =
x*y? + x?y4 + 2372
x²y?
aty? + x?y* + 237
,2,,4
D) S(x, y)
Solve the following problem by using the Simplex approach:
Maximize Z = 4X1 – 6X2
Subject to:
3X1 + 2X2 > 6
2X1 + X2 < 2
3X1 – 2X2 < 4
all variables > 0
Solve the following model using Excel:
maximize Z = 3x1 + 6x2($, profit)
subject to
3x1 + 2x2 ≤ 18 (units, resource 1)
I₁ + x2 > 5 (units, resource 2)
₁ ≤ 4 (units, resource 3)
x1, x2 > 0
Chapter 6 Solutions
Finite Mathematics for Business, Economics, Life Sciences and Social Sciences
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.
Solve ANY Optimization Problem in 5 Steps w/ Examples. What are they and How do you solve them?; Author: Ace Tutors;https://www.youtube.com/watch?v=BfOSKc_sncg;License: Standard YouTube License, CC-BY
Types of solution in LPP|Basic|Multiple solution|Unbounded|Infeasible|GTU|Special case of LP problem; Author: Mechanical Engineering Management;https://www.youtube.com/watch?v=F-D2WICq8Sk;License: Standard YouTube License, CC-BY