(i) x2(3 - 2x +x2) for x = 1; x = -1; x = 2/3 and x = -1/2
Answers
Answer:
20 pts PROBLEM 2 The following math program is provided: MAX Z= 2x1 +x2 s.t. X1 +X2 < 6 X1 +-2x2 < 10 X1 [2] [3] [4] [5],[6] X -X2 <2 X120X220 (a – 5 pts) Plot the feasible region. Identify and label each CPF solution with its coordinates. Plot any two of the Z lines. (b – 3 pts) Solve the problem graphically. Provide optimal values for the Z and the decision variables. (C-3 pts) Calculate the shadow price of b1 = 6. (d – 3 pts) Calculate the allowable decrease of by = 5 (e-6 pts) A new constraint [7] x1 + x22k is added to your problem. Indicate for what (range of) k values (if any) you will have the following situations: • [7] is redundant • [7] is binding • The problem is infeasible
Show transcribed image text
Expert Answer
Transcribed image text: 20 pts PROBLEM 2 The following math program is provided: MAX Z= 2x1 +x2 s.t. X1 +X2 < 6 X1 +-2x2 < 10 X1 [2] [3] [4] [5],[6] X -X2 <2 X120X220 (a – 5 pts) Plot the feasible region. Identify and label each CPF solution with its coordinates. Plot any two of the Z lines. (b – 3 pts) Solve the problem graphically. Provide optimal values for the Z and the decision variables. (C-3 pts) Calculate the shadow price of b1 = 6. (d – 3 pts) Calculate the allowable decrease of by = 5 (e-6 pts) A new constraint [7] x1 + x22k is added to your problem. Indicate for what (range of) k values (if any) you will have the following situations: • [7] is redundant • [7] is binding • The problem is infeasible