Consider the following Linear Program:

Minimize Z= 2x1 + 5x2 + 4x3

subject to

-x1 + 3x2 + 7x3 < 40 (Constraint-A)

5x1 - 6x2 + 3x3

> 15 (Constraint-B)

Xi + x2 + 2x3 < 10 (Constraint-C)

X0, X20, x3 urs

a) Work through Simplex in Tabular form, using the Big M method, to determine the Optimal solution.

b) Apply Simplex in Tabular form, using the Two-Phase method, to determine the Optimal solution.

c) Assess whether the obtained Optimal Solution is Degenerate or not, and Multiple Optimal or not. Give reasons for your assessment.

d) Which of the above two methods (in parts a and b) do you prefer for solving an LP, and why?