Consider the following problem. Minimize Z = 2x1 +3x2 + x3, Subject to and x1 0,

Question:

Consider the following problem.
Minimize Z = 2x1 +3x2 + x3,
Subject to

and
x1 ‰¥ 0, x2 ‰¥ 0, x3 ‰¥ 0.
(a) Reformulate this problem to fit our standard form for a linear programming model presented in Sec. 3.2.
(b) Using the Big M method, work through the simplex method step by step to solve the problem.
(c) Using the two-phase method, work through the simplex method step by step to solve the problem.

(d) Compare the sequence of BF solutions obtained in parts (b) and (c). 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?

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