Use a graphing calculator or a computer program for the simplex method to solve this linear programming problem. X2 X3 X4 .375 .625 0 .75 .25 125 0 -105-80 -75 - 65 X1 0 0 1 S1 1 .5 .375 0 olo 0 0 20100 30010 530 630 280 0 = The optimal solution X₁ = X₂=₁ X3 = and X4 = (Do not round until the final answer. Then round to the nearest integer as needed.) produces the maximum value

6.2 9 please fill in A

The initial tableau of a linear programming problem is given. Use the simplex method to solve the problem. X1 X2 135 4 $1 1100 3223 1 -5 -1 -3 NOO $2 0 0 19 1 0 42 0 120 = The maximum is when x₁ = X2, X3 = 0, S₁ = 0, and $2 = . (Type integers or simplified fractions.)

Use a graphing calculator or a computer program for the simplex method to solve this linear programming problem. X2 X3 X4 51 $2 $3 0 0 .375 .625 1 0 0 480 0 .75 .5 .375 0 1 0 610 1 .25 .125 0 0 0 1 280 -105 -75-65-55 0 0 0 0 The optimal solution x₁ = ☐, ×₂ = ☐, ×3 = ☐, and x4 = ☐ produces the maximum value ☐. (Do not round until the final answer. Then round to the nearest integer as needed.)