Consider the problem maximize Z = 5 x1 +3 x2 + 2 x3 + 4 x4
subjectto
5 x1 + x2 + x3 + 8 x4 = 10
2 x1 + 4 x2 + 3 x3 + 2 x4 =10
X j > 0, j=1,2,3,4
(a) Make the necessary row reductions to have the tableau readyfor iteration 0. On this tableau identify the corresponding initial(artificial) basic feasible solution. Also, identify the initialentering and leaving variables.
(b) Following the result obtained in (a) solve by the Simplexmethod, using the Big-M method.
(c) Solve by the Two-Phase method.
