Solve the given linear programming problem using the table method. The table of basic solutions is provided.   Maximize P=15x1+7x2 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 following linear program by simplex method: minimize -x12x₂ 2x1x2 ≤ 4 - x1 + x₂ ≤ 2 3x1 + x2 ≤ 6 x1 + x₂ ≥ 1 x1, x2 > 0

Solve the linear programming problem using the simplex method. Maximize P = -x₁ + 2x₂ subject to x₁ + x₂ ≤2 -X₁ + 3x₂ ≤18 X₁-4x2 ≤8 X₁, X₂ 20 Select the correct choice below and, if necessary, fill in the answer boxes to complete your choice. OA. The maximum value of P is P= (Simplify your answers.) OB. There is no optimal solution. when x₁ = *** and X₂=