Chapter 4.1, Problem 5E

In Exercises 1-6, (a) write the linear programming problem as a standard maximization problem if it is not already in that form, and (b) write the initial simplex tableau.

Maximize $P=x+3y+4z$ subject to the constraints

$\begin{array}{c}x+2y+z+\le 40\\ -x-y-z\ge -30\\ x\ge 0,y\ge 0,z\ge 0\end{array}$