Solve the linear programming problem below using the simplex method. You MUST SHOW ALL OF THE STEPS OF
THE SIMPLEX METHOD, including the initial simplex tableau, identifying the pivot column/row, and all row operations
(using subscript notation) performed to pivot. If you do not include all of this in the work you upload, you will not earn
credit! A correct answer without work is worth ZERO POINTS!
Maximize $z = 2x_1 + 9x_2$ subject to
$5x_1 + x_2 \le 30$
$9x_1 + 2x_2 \le 50$
$x_1 + x_2 \le 40$
$x_1, x_2 \ge 0.$Select the correct choice below and, if necessary, fill in the answer box to complete your choice.
A. The maximum is $z = \boxed{}$ when $x_1 = \boxed{}, x_2 = \boxed{}, s_1 = \boxed{}, s_2 = \boxed{},$ and $s_3 = \boxed{}.$
B. There is no maximum solution for this linear programming problem.
