Given the Following Linear Programming Problem Using the Simplex Method, What Is the Optimal Value for }

question 11

Short Answer

Given the following linear programming problem:
$\begin{array} { l l } \operatorname { maximize } & \mathrm { Z } = \$ 100 x _ { 1 } + 80 x _ { 2 } \\\text { subject to } & x _ { 1 } + 2 x _ { 2 } \leq 40 \\& 3 x _ { 1 } + x _ { 2 } \leq 60 \\& x _ { 1 } , x _ { 2 } \geq 0\end{array}$
Using the simplex method, what is the optimal value for the objective function?