In: Statistics and Probability
The optimal solution of the linear programming problem is at the intersection of constraints 1 and 2. Please answer the following questions by using graphical sensitivity analysis.
Max s.t.
Max 2x1 + x2
s.t. 4x1 +1x2 ≤8
4x1 +3x2 ≤12
1x1 +2x2 ≤6
x1 , x2 ≥ 0
Over what range can the coefficient of x1 vary before the current solution is no longer optimal?
Over what range can the coefficient of x2 vary before the current solution is no longer optimal?
Compute the dual price for the first constraint.