Question: For the linear program: Max 3A + 4B s.t. A + 2B 8 Constraint 1 A + 2B 12 Constraint 2 2A + B 16
For the linear program:
Max 3A + 4B
s.t.
A + 2B 8 Constraint 1
A + 2B 12 Constraint 2
2A + B 16 Constraint 3
A, B 0
Should be done manually (must show hand work). The question I need answered is "G) Which constraints have non-zero shadow prices? Explain." I am only including the other parts of the question in case they are needed to answer the last one which is G.
A)Making A as the horizontal variable, graph the problem neatly. Show the feasible region. Label constraints on graphs.
B)Solve the problem. Show work. What is the optimal A and B values? What is the optimal objective function value?
C)What are the values of slack and surplus for each constraint?
D)Holding the coefficient of B in the objective function fixed, how much can the coefficient of A decrease or increase so that the optimal solution does not change?
E)Holding the coefficient of A in the objective function fixed, how much can the coefficient of B decrease or increase so that the optimal solution does not change?
F)Suppose the coefficient of A changes from 3 to 5 and the coefficient of B changes from 4 to 2. Will the optimal solution change? If so, what is the new optimal solution?
G)Which constraints have non-zero shadow prices? Explain.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
