Question

a. Set up the initial simplex tableau for this linear programming problem. b. Use the simplex method to solve the linear programming problem. Maximize $z = 9x_1 + 2x_2 + x_3$ subject to: $x_1 + 5x_2 + 10x_3 \le 110$ $x_1 + 2x_2 + 11x_3 \le 209$ with $x_1 \ge 0, x_2 \ge 0, x_3 \ge 0$. a. Set up the initial simplex tableau. $\begin{array}{|c|c|c|c|c|c|} \hline x_1 & x_2 & x_3 & s_1 & s_2 & z \\ \hline 1 & & & 1 & 0 & 0 \\ & & 11 & 0 & & 0 \\ & -2 & & 0 & 0 & 1 \\ \hline & & & & & 209 \\ \end{array}$ b. The maximum is when $x_1 = $, $x_2 = $, and $x_3 = $ (Simplify your answers.)

          a. Set up the initial simplex tableau for this linear programming problem.
b. Use the simplex method to solve the linear programming problem.
Maximize $z = 9x_1 + 2x_2 + x_3$
subject to: $x_1 + 5x_2 + 10x_3 \le 110$
$x_1 + 2x_2 + 11x_3 \le 209$
with $x_1 \ge 0, x_2 \ge 0, x_3 \ge 0$.
a. Set up the initial simplex tableau.
$\begin{array}{|c|c|c|c|c|c|}
\hline
x_1 & x_2 & x_3 & s_1 & s_2 & z \\
\hline
1 & & & 1 & 0 & 0 \\
& & 11 & 0 & & 0 \\
& -2 & & 0 & 0 & 1 \\
\hline
& & & & & 209 \\
\end{array}$
b. The maximum is  when $x_1 = $, $x_2 = $, and $x_3 = $
(Simplify your answers.)

a. Set up the initial simplex tableau for this linear programming problem.
b. Use the simplex method to solve the linear programming problem.
Maximize z = 9x1 + 2x2 + x3
subject to: x1 + 5x2 + 10x3 ≤ 110
x1 + 2x2 + 11x3 ≤ 209
with x1 ≥ 0, x2 ≥ 0, x3 ≥ 0.
a. Set up the initial simplex tableau.
x1 x2 x3 s1 s2 z

1 1 0 0
11 0 0
-2 0 0 1
209
b. The maximum is when x1 =, x2 =, and x3 =
(Simplify your answers.)

Added by Teresa A.

Question

Please give Ace some feedback