Question: You are given the following linear programming problem. Maximize Z = 4x1 + 2x2, subject to and x1 ¥ 0, x2 ¥ 0. D,I (a)
Maximize Z = 4x1 + 2x2, subject to
.png)
and
x1 ¥ 0, x2 ¥ 0.
D,I (a) Solve this problem graphically.
(b) Use graphical analysis to find the shadow prices for the resources.
(c) Determine how many additional units of resource 1 would be needed to increase the optimal value of Z by 15.
s 16 (resource 1) x 32 17 (resource 2) s 5 (resource 3)
Step by Step Solution
3.27 Rating (171 Votes )
There are 3 Steps involved in it
a Optimal Solution x 1 x 2 8 3 and Z 38 b Increasing resource 1 to 17 units increases Z to ... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
545-M-S-L-P (373).docx
120 KBs Word File
