Solve the linear programming problem using the simplex method. P=7X₁ +2X2 X3 Maximize subject to X₁ + X2 X3 ≤7 2X1 2x₁ +4x2+3x3 ≤21 X1, X2, X3 20 Use the simplex method to solve the problem. Select the correct choice belc if necessary, fill in the answer boxes to complete your choice. OA. The maximum value of P is when x₁ = x₂ = , and x3 = (Simplify your answers. Type integers or decimals rounded to the ne tenth as needed.) OB. 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

Subject: calculus 

 

 

Solve the linear programming problem using the simplex method.
Maximize
P=7X₁ + 2X2 X3
X₁ + X2 X3 ≤7
subject to
2x₁ +4x2+3x3 ≤21
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.
and X3
when x₁ = x2 =
(Simplify your answers. Type integers or decimals rounded to the nearest
tenth as needed.)
OA. The maximum value of P is
OB. There is no optimal solution.
Transcribed Image Text:Solve the linear programming problem using the simplex method. Maximize P=7X₁ + 2X2 X3 X₁ + X2 X3 ≤7 subject to 2x₁ +4x2+3x3 ≤21 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. and X3 when x₁ = x2 = (Simplify your answers. Type integers or decimals rounded to the nearest tenth as needed.) OA. The maximum value of P is OB. There is no optimal solution.
Expert Solution
steps

Step by step

Solved in 3 steps

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