Home /
Expert Answers /
Advanced Math /
solve-the-linear-programming-problem-using-the-simplex-method-maximize-m-x-3-y-9-z-subject-t-pa349
(Solved): Solve the linear programming problem using the simplex method. Maximize \( M=x+3 y+9 z \) subject t ...
Solve the linear programming problem using the simplex method. Maximize \( M=x+3 y+9 z \) subject to \[ \begin{array}{l} x+4 z \leq 20 \\ 3 y+z \leq 24 \\ x, y, z \geq 0 \end{array} \] Find the solution. \[ x=, y=, z=, M= \]