The optimal solution of the linear programming problem is at the intersection of constraints 1 and 2. Max 2x₁ + x₂ s.t.4x₁ + 1x₂

Question

The optimal solution of the linear programming problem is at the intersection of constraints 1 and 2.
Max 2x₁ + x₂
s.t.4x₁ + 1x₂ < 400
4x₁ + 3x₂ < 600
1x₁ + 2x₂

\le

300
x₁ ,x₂ > 0
a.Over what range can the coefficient of x₁ vary before the current solution is no longer optimal?
b.Over what range can the coefficient of x₂ vary before the current solution is no longer optimal?
c.Compute the dual prices for the three constraints.

Quizplus · Accepted Answer

The Answer of The optimal solution of the linear programming problem is at the intersection of constraints 1 and 2. Max 2x₁ + x₂ s.t.4x₁ + 1x₂ < 400 4x₁ + 3x₂ < 600 1x₁ + 2x₂ $\le$ 300 x₁ ,x₂ > 0 a.Over what range can the coefficient of x₁ vary before the current solution is no longer optimal? b.Over what range can the coefficient of x₂ vary before the current solution is no longer optimal? c.Compute the dual prices for the three constraints.

The Optimal Solution of the Linear Programming Problem Is at the Intersection