Find the maximum and/or minimum value(s) of the objective function on the feasible set S. (If an answer does not exist, enter DNE.) Z = 4x + 2y maximum minimum Need Help? (1.4) Read it (3,6) S P=x-2y (3,1) DETAILS PREVIOUS ANSWERS TANFIN12 3.3.008. The maximum is PI Solve the linear programming problem by the method of corners. Maximize subject to (5.4) x+y s4 2x-y≤5 x20 y 20 xat (x,y) - 1.3

Linear programming

Use the simplex method to solve. The maximum is z = (Simplify your answers.) Maximize z=3x1 +2x2 + 2x3 subject to: x₁ + x2 + 2x3 ≤38 2x1 + x2 + x32 29 X₁ 20, X₂20, X3 20 with when x₁ = x₂ =, and x3 = | I

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 =