Solve the linear programming problem using the simplex method.
Maximize z=2x₁+5x₂ subject to
5 x₁+x₂?30
5 x₁+2 x₂?50
x₁+x₂?40  
x₁, x₂?0 .
Select the correct choice below and, if necessary, fill in the answer box
to complete your choice.
A. The maximum is z= ? when x₁=?,x₂=?,s₁=?,s₂=?, and s₃=?
B. There is no maximum solution for this linear programming problem.

Answer rating: 100% (QA)

The detailed answer for the above question is provided below Lets set up the initial table The first ... View the full answer