Follow the instructions of Prob. 4.6-5 for the following problem. Minimize Z = 5,000x1 + 7,000x2 Subject
Question:
Minimize Z = 5,000x1 + 7,000x2
Subject to
and
x1 ‰¥ 0, x2 ‰¥ 0.
(a) Demonstrate graphically that this problem has no feasible solutions.
(b) Use a computer package based on the simplex method to determine that the problem has no feasible solutions.
(c) Using the Big M method, work through the simplex method step by step to demonstrate that the problem has no feasible solutions.
(d) Repeat part (c) when using phase 1 of the two-phase method.
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Introduction to Operations Research
ISBN: 978-1259162985
10th edition
Authors: Frederick S. Hillier, Gerald J. Lieberman
Question Posted: