The initial simplex tableau of a linear programming problem is shown below. Answer parts (a)- (c). X₁ X₂ X3 S₁ S₂ Z 1 1

[answerhappygod]

The Initial Simplex Tableau Of A Linear Programming Problem Is Shown Below Answer Parts A C X X X3 S S Z 1 1 1 (26.97 KiB) Viewed 51 times

The initial simplex tableau of a linear programming problem is shown below. Answer parts (a)- (c). X₁ X₂ X3 S₁ S₂ Z 1 1 1 1 0 2 1 2 0 1 -2 -2 -1 0 0 0 12 0 34 10 C (a) Use the simplex method to solve the problem with column 1 as the first pivot column. Select the correct choice below and, f necessary, fill in the answer box to complete your choice. A. The maximum is 24 when x₁ = 12, x₂ = 0, x3 = 0, s₁ = 0 and s₂ = 10. OB. There is no maximum solution for this linear programming problem. (b) Now use the simplex method to solve the problem with column 2 as the first pivot column. Select the correct choice below and, if necessary, fill in the answer box to complete your choice. A. The maximum is | when x₁ = ₁ x₂ = ₁ ×3 = . $₁ = and $₂ = O B. There is no maximum solution for this linear programming problem.