Max Z = 2x + 3y s.t. x + y <= 3 x + 2y <= 4 For your problem: (1) Graph the LP (2) Find the Max (3) Find the range of values for the right had side of the binding constraints that make sense, if you hold the other one still. That is, you will allow one constraint to change at a time.
Max Z = 2x + 3y
s.t.
x + y <= 3
x + 2y <= 4
For your problem:
(1) Graph the LP
(2) Find the Max
(3) Find the range of values for the right had side of the binding constraints that make sense, if you hold the other one still. That is, you will allow one constraint to change at a time.
(4) Find the delta (how much you might change the RHS) for each of the binding constraints
(5) Find the shadow price for each
(6) Which constraint is better to change? Why?
(7) Find the range of slopes, and the exact slopes, for the objective function which will make each corner point, and each line segment between them, optimal
(8) How much can you change the coefficient of x by to get the slope of the objective function in that range or at that value?
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 2 images
