Solve the linear programming problem using the simplex method. Maximize subject to BECOD P=30x, +40x₂ 2x₁ + x₂ 540 X₁ + X₂ ≤28 X₁ + 2x₂ 48 x₁.x₂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. OA. The maximum value of P is when x,- and x₂ - B. There is no optimal solution.

College Algebra (MindTap Course List)
12th Edition
ISBN:9781305652231
Author:R. David Gustafson, Jeff Hughes
Publisher:R. David Gustafson, Jeff Hughes
Chapter6: Linear Systems
Section6.8: Linear Programming
Problem 34E
icon
Related questions
Question

Given detail solution

Solve the linear programming problem using the simplex
method.
Maximize
subject to
when x₁ =
P=30x, +40x₂
2x₁ + x₂ 540
X₁ + X₂ ≤28
X₁ + 2x₂ ≤48
x.x₂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.
OA. The maximum value of P is
and x₂ -.
B. There is no optimal solution.
Transcribed Image Text:Solve the linear programming problem using the simplex method. Maximize subject to when x₁ = P=30x, +40x₂ 2x₁ + x₂ 540 X₁ + X₂ ≤28 X₁ + 2x₂ ≤48 x.x₂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. OA. The maximum value of P is and x₂ -. B. There is no optimal solution.
Expert Solution
steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Recommended textbooks for you
College Algebra (MindTap Course List)
College Algebra (MindTap Course List)
Algebra
ISBN:
9781305652231
Author:
R. David Gustafson, Jeff Hughes
Publisher:
Cengage Learning