Question: For the following linear programming problem: Max 2x1 + x2 s.t. 4x1 + 1x2 400 4x1 + 3x2 600 1x1 + 2x2 300 x1, x2
For the following linear programming problem: Max 2x1 + x2 s.t. 4x1 + 1x2 400 4x1 + 3x2 600 1x1 + 2x2 300 x1, x2 0 (a) Find the optimal solution by graphical method. (b) Over what range can the coefficient of x1 vary before the current solution is no longer optimal? (c) Over what range can the coefficient of x2 vary before the current solution is no longer optimal? (d) Compute the dual values for the three constraints.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
