Question: Consider the following problem. Maximize Z = 5x1 + 4x2 x3 + 3x4, Subject to and x1 ¥ 0, x2 ¥ 0, x3 ¥ 0,
Maximize Z = 5x1 + 4x2 x3 + 3x4,
Subject to
and
x1 ¥ 0, x2 ¥ 0, x3 ¥ 0, x4 ¥ 0.
(a) Work through the simplex method step by step to solve the problem.
(b) Identify the shadow prices for the two resources and describe their significance.
(c) Use a software package based on the simplex method to solve the problem and then to generate sensitivity information. Use this information to identify the shadow price for each resource, the allowable range for each objective function coefficient and the allowable range for each right and side.
3x1 + 2x2-3x3 + x4 3xi + 3x2+ X3 24 36 (resource 2) (resource l) 3x
Step by Step Solution
3.45 Rating (184 Votes )
There are 3 Steps involved in it
a Optimal Solution x 1 x 2 x 3 x 4 11 0 3 0 and Z 52 b The sh... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
545-M-S-L-P (376).docx
120 KBs Word File
