Question: Consider the following linear programming model: Max. X1 + 2X2 S.T. X1 + X2 5 X2 3.5 3X1 - X2 9 X1, X2 0 a.
Consider the following linear programming model:
Max. X1 + 2X2
S.T.
X1 + X2 5
X2 3.5
3X1 - X2 9
X1, X2 0
a. Use the graphical method to solve the above problem. Indicate clearly the feasible region and the optimal solution on the graph. Report the optimal solution and the optimal objective value. (10 points)
b. What would be the optimal solution if X1 and X2 were required to be integer? (5 points)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
