This is the initial tableau of a linear programming problem. Solve by the simplex method. X₁ X2 S₁ $2 S3 1 4 1 0 0 5 0 1 0 6 0 0 1 - 1 0 0 0 2 1 - 2 The maximum is when X₁ S₁ = 10, S₂ = 0, and s3 = = 2. = Z 0 0 0 12 4 4 0 x₂ = ₁

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.

Find out if it’s a linear program or not if it reformulate it in standard inequality form.

Use the simplex method to solve the linear programming problem. z= 5x, +2x2 +X3 4x1 +4x2 + Maximize subject to X3 S36 X1 + 3x2 + 5x3 511 X1 20, X2 20, x3 20. Select the correct choice below and, if necessary, fill in the answer boxes to complete your choice. when x, X2 =, x3 = The maximum is and S2 %3D O A. B. There is no maximum.