Chapter 4.2, Problem 5E

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

5. $\begin{array}{l}{x}_1{x}_2{x}_3{s}_1{s}_2{s}_{3}z\\ \left[\begin{array}{rrrrrrrr}\hfill 2& \hfill 2& \hfill 8& \hfill 1& \hfill 0& \hfill 0& \hfill 0& \hfill 40\\ \hfill 4& \hfill -5& \hfill 6& \hfill 0& \hfill 1& \hfill 0& \hfill 0& \hfill 60\\ \hfill 2& \hfill -2& \hfill 6& \hfill 0& \hfill 0& \hfill 1& \hfill 0& \hfill 24\\ \hfill -14& \hfill -10& \hfill -12& \hfill 0& \hfill 0& \hfill 0& \hfill 1& \hfill 0\end{array}\right]\end{array}$