Question 1088107: 2. Consider the Linear programming formulation below:
Minimize cost = $1X1 + $2X2
Subject to:
X1 + 3X2 ≥ 90
8X1 +2X2 ≥ 160
3X1 + 2X2 ≥ 120
X2 ≤ 70
X1 X2 ≥ 0
d. Solve the above linear programming model, using corner point graphical approach. Indicate your corner points coordinates on the graph.
e. Shade your feasible region and determine the best combination of X1 and X2 that yields the highest profit.
Answer by Fombitz(32388)   (Show Source):
You can put this solution on YOUR website! Graph the constraints to identify the feasible region, I will use software that uses x,y instead of x1,x2.
.
.
.
 .
.
.
.
The feasible region is unbounded however since you're looking for minimum value of an addition of two variables, larger positive numbers will not give you smaller values.
Check the value at the vewrtices:
(0,90)
(0,80)
(4,48)
(40,0)
I'll do one you do the other three.
One of the values will provide a minimum.
(0,90):
Do the same for the others.
|
|
|
