Consider the following problem.

Minimize Z  3x1  2x2  4x3, subject to 2x1  x2  3x3  60 3x1  3x2  5x3  120 and x1  0, x2  0, x3  0.

I

(a) Using the Big M method, work through the simplex method step by step to solve the problem.

I

(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?

C

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