Given an optimal simplex tableau of a maximization problem and all $<=$ constraints and $!,",$# are

slack variables.

Basic Z $$$ $\%$& $!"$# Right

Side

Z $1000406$

$$$ $011020120$

$$& $000110415$

$"00-20-11310$

Part a$)$ Give the optimal solution for decision variables.

Part b$)$ Give the optimal value for dual decision variables.

Part c$)$ If you could buy an additional unit of the first resource for a cost of $7/2,$ would you do this? Why?

Part d$)$ Find the objective value $.($Hint: you can use matrix operations of Slide $8)$

Part e$)$ Find the range for objective function coefficient of $\%$ that will keep the current solution optimal.