Match the description of the feasible region for a linear programming problem with the corresponding description of the existence of optimal solutions. the feasible region is bounded the feasible region is unbounded and the coefficients of the objective function are positive the feasible region is empty [Choose ] [Choose ] [Choose ]

K Use the simplex method to solve the linear programming problem. Maximize subject to: with Select the correct choice below and, if necessary, fill in the answer boxes to complete your choice. A. The maximum is when x₁ = x₂ = S₁ (Type integers or simplified fractions.) B. There is no maximum. 5₂ = z = 10x₁ +20x₂ 8x₁ +4x₂ 540 4x₁+x2₂ 540 4x₁ +4x₂ 552 X₁ 20, X₂20 and $3 =

Solve the linear programming problem using the simplex method. 5x1 +X2 <70 3x1 +2x2 s90 Maximize z= 2x, + 3x2 subject to %3D X1 + X2 5 80 X1, X2 2 0. .... Select the correct choice below and, if necessary, fill in the answer box to complete your choice. O A. The maximum is z = when x1 = , X2 =, s1 = . $2 , and s3 = %3D O B. There is no maximum solution for this linear programming problem.

Solve the linear programming problem by the method of corners. Maximize P = 4x + 3y     subject to   x  +  y  ≤ 8   2x  +  y  ≤ 10   x ≥ 0, y ≥ 0