Use the simplex method to solve the linear programming

Last updated: 8/9/2022

Use the simplex method to solve the linear programming problem. Maximize z= 5x₁ + 2x₂ + x₃ subject to 3x₁ +9x₂ + x₃ ≤ 6 x₁ +5x₂ + 3x₃ ≤ 15 x₁ ≥ 0, x₂ ≥ 0, x₃ ≥ 0. Select the correct choice below and, if necessary, fill in the answer boxes to complete your choice. ○ A. The maximum is ▢ when x₁ = ▢, x₂ = ▢, x₃ = ▢, s₁ = ▢ and s₂ = ▢ ○ B. There is no maximum.