Question: Suppose that the following constraints have been provided for a linear programming model. and x1 0, x2 0. (a) Demonstrate that
and
x1 ≥ ¥ 0, x2 ≥ ¥ 0.
(a) Demonstrate that the feasible region is unbounded.
(b) If the objective is to maximize Z = – x1 + x2, does the model have an optimal solution? If so, find it. If not, explain why not.
(c) Repeat part (b) when the objective is to maximize Z = x1 – x2.
(d) For objective functions where this model has no optimal solution, does this mean that there are no good solutions according to the model? Explain. What probably went wrong when formulating the model?
x 3x2 30 -3x, 2 30
Step by Step Solution
3.31 Rating (178 Votes )
There are 3 Steps involved in it
a b Yes Optimal solution x 1 x 2 0 10 and Z 10 c No The o... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
545-M-S-L-P (280).docx
120 KBs Word File
