Chapter 4, Problem 22RE

Use the simplex method to solve each maximization linear programming problem with the given initial tableau.

$\begin{array}{l}\begin{array}{cccc}{x}_1& x_2& s_1& s_2\end{array}z\\ \left[\begin{array}{ccc}2& 7& \text{1}\\ 2& 3& \text{0}\\ -2& -4& \text{0}\end{array}\begin{array}{c}\text{0}\\ \text{1}\\ \text{0}\end{array}\begin{array}{c}\text{0}\\ \text{0}\\ \text{1}\end{array}\begin{array}{c}\text{14}\\ \text{10}\\ \text{0}\end{array}\right]\end{array}$