Chapter 6.2, Problem 9E

In Problems 9-12,

(A) Using the slack variables, write the initial system for each linear programming problem.

(B) Write the simplex tableau, circle the first pivot, and identify the entering and exiting variables.

(C) Use the simplex method to solve the problem.

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