valables $s_1,s_2,s_3.$

Answer

ab$.$c$.$de according to the tableat above.

a$)(2$ pts$)$ In which condition is the tableas optimal?

b$)(2pt)$ If $a-5,b-3,c-5$ which variable will enter the basis?

c$)(2$ pts$)$ Let $x_3$ is entering the basis and let chak $0.$ What type of problem $(0\mathrm{.}8,$ infeasible,

unbounded$)$ is this?

d$)(2$ pts$)$ Let $a=0,b-3,$ and $c-5.$ Is the solution optimal? If $x_2$ enters the basis, does the objective

function value change? Why?

e$)(2pts)$ Suppose that $x_2$ enters the basis and $s_3$ is leaving the basis. Let $n=3,-6$ and $p-0.$ In the new

tableau, it is seen that the value of $m$ is the same. Why do you think the objective function value did not

improve?

The following is the optimal simplex tableau of a linear programming problem. The objective is to

minimize $-2x_4-x_5-2x_6$ and $x_1,x_2$ and $x_3$ are the slack variables.

Answer $f,g,h,$ and i according to the tableau above.

bi$)12$ prostad