Solve the given linear programming problem using the table method. The table of basic solutions is provided.   Maximize P=15x1+6 subject to    x1+x2≤6                     x1+4x2≤12                     x1​, x2≥0   x1      x2        s1       s2       ​Feasible? 0       0          6        12           Yes 0       6          0       −12          No 0       3          3          0           Yes 6       0          0          6           Yes 12      0        −6         0           No 4       2          0          0           Yes

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. Maximize P=6x+6y Subject to 2x + y ≤ 30 x+2y ≤ 24 x, y ≥ 0

Solve the given linear programming problem using the table method. The table of basic solutions is provided. Maximize P= 15x, + 8x2 subject to X, + X2 56 Xq + 4x2 s 12 X1, X2 20 x1 S2 Feasible? Yes 6. 0. 12 No: Yes 6. -12 9. Yes No 12 4 -6 0. Yes