Chapter 6, Problem 34RE

Solve the following linear programming problem by the simplex method, keeping track of the obvious basic solution at each step. Then graph the feasible region and illustrate the path to the optimal solution determined by the simplex method.

$\begin{array}{l}\text{Maximize }P=2x_1+3x_2\\ \text{subject to }{x}_1+2x_2\le 22\\ \text{ 3}{x}_1+x_2\le 26\\ x_1\le 8\\ x_2\le 10\\ x_1,x_2\ge 0\end{array}$