Chapter 6.2, Problem 33E

In Problems 33 and 34, first solve the linear programming problem by the simplex method, keeping track of the basic feasible solutions 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+5x_2\\ \text{subject to }{x}_1+2x_2\le 40\\ x_1+3x_2\le 48\\ x_1+4x_2\le 60\\ x_2\le 14\\ x_1,x_2\ge 0\end{array}$