K Use the simplex method to solve the linear programming problem. Z = X₁ +5x₂ + x3 +7x4 X₁ + 9x2 + 7x₁ + x₂ + x₁20, X₂20, x3 20, x4 20 Maximize subject to x3 + x4 ≤60 3x3 + x4≤180 Select the correct choice below and, if necessary, fill in the answer boxes to complete your choice. A. The maximum is when x₁ = x₂ = x3 = x₁ = . $₁=₁ and $₂ = 0 B. There is no maximum.

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 2SC
icon
Related questions
Question
K
Use the simplex method to solve the linear programming problem.
Z = X₁ +5x₂ + x3 +7x4
X₁ + 9x2 +
Maximize
subject to
x3 + x4 ≤60
7x₁ + x₂ +
x₁20, x₂ 20, x320, x4 20
A. The maximum is
B. There is no maximum.
3x3 + x4 ≤180
Select the correct choice below and, if necessary, fill in the answer boxes to complete your choice.
when x₁ = x₂ =
x3 = x₁ = $₁=, and $₂ = [
Transcribed Image Text:K Use the simplex method to solve the linear programming problem. Z = X₁ +5x₂ + x3 +7x4 X₁ + 9x2 + Maximize subject to x3 + x4 ≤60 7x₁ + x₂ + x₁20, x₂ 20, x320, x4 20 A. The maximum is B. There is no maximum. 3x3 + x4 ≤180 Select the correct choice below and, if necessary, fill in the answer boxes to complete your choice. when x₁ = x₂ = x3 = x₁ = $₁=, and $₂ = [
Expert Solution
steps

Step by step

Solved in 2 steps with 2 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
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage