Chapter 4.2, Problem 1E

In Exercises 1–6, the initial tableau of a linear programming problem is given. Use the simplex method to solve each problem.

1. $\begin{array}{l}{x}_1{x}_2{x}_3{s}_1{s}_{2}z\\ \left[\begin{array}{rrrrrrr}\hfill 1& \hfill 4& \hfill 4& \hfill 1& \hfill 0& \hfill 0& \hfill 16\\ \hfill 2& \hfill 1& \hfill 5& \hfill 0& \hfill 1& \hfill 0& \hfill 20\\ \hfill -3& \hfill -1& \hfill -2& \hfill 0& \hfill 0& \hfill 1& \hfill 0\end{array}\right]\end{array}$