Question: A linear program has been formulated and solved. The optimal simplex tableau for this is given at the bottom of this page. (a) What are
A linear program has been formulated and solved. The optimal simplex tableau for this is given at the bottom of this page.
(a) What are the shadow prices for the three constraints? What does a zero shadow price mean? How can this occur?
(b) How much could the right-hand side of the first constraint be changed without changing the solution mix (i.e., perform RHS ranging for this constraint)?
(c) How much could the right-hand side of the third constraint be changed without changing the solutionmix?
.png)
120 90 0 SOLUTION MIx S QUANTITY 0 120 0.125 10.125 0 3.75 -0.75 37.5 12.5 10.0 5,625 3.5 125 0 -0.5 135 120 90 -55 0 -3.5-22.5
Step by Step Solution
3.38 Rating (160 Votes )
There are 3 Steps involved in it
a The shadow prices are 375 for constraint 1 225 for constraint 2 and 0 for const... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
162-M-S-L-P (140).docx
120 KBs Word File
