Question: . Consider the Linear Program: MAXIMIZE Z = 7X 1 + 10X 2 Subject to: 2X 1 + 3X 2
. Consider the Linear Program: MAXIMIZE Z = 7X1 + 10X2
Subject to: 2X1 + 3X2 <= 120
5X1 + 4X2 80
2X1 + X2 <= 64
X1 and X2 >= 0
(a) Calculate the slack or surplus (indicate which it is) in each of the three resource constraints at the optimal solution.
(b) Calculate the shadow price for each of the three constraints.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
