The initial tableau of a linear programming problem is given. Use the simplex method to solve the problem. x2 S₁ $2 2 1 0 1 0 1 0 0 0 0 X₁ 1 4 -4 -2 $3 0 1 0 NOOOT 0 0 0 13 32 7 The maximum is when x₁ = x₂=₁s₁=₁ $₂ = and $₂ = (Type integers or simplified fractions.)

1) Build as few polynomial functions as possible to satisfy each constraint at least once. Record your functions in factored form. A. C. E. G. Has 2 negative x-intercepts Has a positive y-intercept Opens down Has an x-intercept with an order of 2 * Add more rows if needed Polynomial Function Constraints satisfied B. D. F. H. Never enters Quadrant I Ends in Quadrant I Three x-intercepts Has 3 turning points How and why you built

For an optimization problem below, state and explain which of the four assumptions of linear programming is/are not satisfied. max 5x12 s.t. 3r+2r2 ≤ 10 1 + 2x₂-12 23 ₁=nonnegative integer, -35 2₂ 55

Solve it early but correctly

Solve the linear programming problem using the simplex method. Maximize subject to P= 3x₁ + 2x₂ - X3 X₁ + X₂-X3 ≤5 2x₁ +4x2 + 3x3 ≤ 15 X1, X2, X3 20 Use the simplex method to solve the problem. Select the correct choice below and, if necessary, fill in the answer boxes to complete your choice. O A. The maximum value of Pis when X₁ = x₂ = and X3 = (Simplify your answers. Type integers or decimals rounded to the nearest tenth as needed.) OB. There is no optimal solution.

need ASAP please be fast and I'll rate positive for sure

Use the simplex method to solve the problem. Maximize P= 32x, +24x2 subject to 2x, +x, s 16 X, +8x, s 16 Xq, X2 20 The maximum value is P | when X2 = []: x, = (Simplify your answers.) Enter your answer in each of the answer boxes. FEB 16 W