Follow the instructions of Prob. 4.6-9 for the following problem.
Minimize Z = 3x1 + 2x2 + 7x3
Subject to

and x1 ‰¥ 0, x2 ‰¥ 0, x3 ‰¥ 0.
(a) Using the Big M method, work through the simplex method step by step to solve the problem.
(b) Using the two-phase method, work through the simplex method step by step to solve the problem.

(c) Compare the sequence of BF solutions obtained in parts (a) and (b). Which of these solutions are feasible only for the artificial problem obtained by introducing artificial variables and which are actually feasible for the real problem?

(d) Use a software package based on the simplex method to solve the problem.

Transcribed Image Text:

-ri+X2 =10