5 DR Solve the linear programming problem using the simplex

Last updated: 7/8/2022

5 DR Solve the linear programming problem using the simplex method. Maximize z=2x, +5x₂ subject to 5Xq+xy 550 5x₁ + 2x₂ ≤70 X₁ + X₂ ≤60 X₁, X₂ ≥ 0. ***** Select the correct choice below and, if necessary, fill in the answer box to complete your choice. OA. The maximum is z = when X₁ = X2=S₁ = S₂ = OB. There is no maximum solution for this linear programming problem.