Use the Simplex Method to Solve the Linear Programming Problem $\mathrm{z}=7 \mathrm{x}_{1}+2 \mathrm{x}_{2}+\mathrm{x}_{3}$

Multiple Choice

Use the simplex method to solve the linear programming problem.
-Maximize $\mathrm{z}=7 \mathrm{x}_{1}+2 \mathrm{x}_{2}+\mathrm{x}_{3}$
Subject to: $x_{1}+5 x_{2}+7 x_{3} \leq 8$
$x_{1}+4 x_{2}+11 x_{3} \leq 9$
With $\quad x_{1} \geq 0, x_{2} \geq 0, x_{3} \geq 0$

A) Maximum is 9 when $x_{1}=1, x_{2}=1, x_{3}=0$
B) Maximum is 56 when $x_{1}=8, x_{2}=0, x_{3}=0$
C) Maximum is 63 when $x_{1}=9, x_{2}=0, x_{3}=0$
D) Maximum is 0 when $x_{1}=0, x_{2}=0, x_{3}=8$