Q $2($b$)$

Answer the following questions for the linear programming problem given below:

i$.$ Write the Phase$-$One LP model

$(2$ Marks$)$

ii$.$ Conduct one iteration of the Simplex method.

$(11$ Marks$)$

iii. Describe how the optimal solution to the original problem will be determined

from this point on$.$

$(2$ Marks$)$

maxz$=x_1+3x_2+4x_3$

Subject $to$:

$x_1+2x_2+x_3=5$

$2x_1+3_{x_2}+x_3=6$

$x_{1}is$ unrestricted

$x_2,x_{3}0$

$[$End of Question $2]$