Problem 0.0.5. Complete finding the optimal solution of the following linear programming problem using the simplex method depending on starting from the tableau below. Maximize Z= 12x1 +23x2+19x3 subject to x1-x2+2x3 ≤ 16 x₁-2x2+3x3 ≤ 20 12x2 + x3 ≤ 10 3x1 + 10x2+4x3 ≤9 X1, X2, X3 20

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 32E
icon
Related questions
Question
Problem 0.0.5. Complete finding the optimal solution of the following linear programming problem using
the simplex method depending on starting from the tableau below.
Maximize Z 12x1 +23x2 + 19x3
subject to x1-x2+2x3 ≤ 16
X₁-2x2 + 3x3 ≤ 20
12x2 + x3 ≤ 10
3x1 + 10x2 + 4x3 ≤9
X1, X2, X3 20
(final answer: Z=42.75, x₁=0, x2=0, x3 = 2.25)
Transcribed Image Text:Problem 0.0.5. Complete finding the optimal solution of the following linear programming problem using the simplex method depending on starting from the tableau below. Maximize Z 12x1 +23x2 + 19x3 subject to x1-x2+2x3 ≤ 16 X₁-2x2 + 3x3 ≤ 20 12x2 + x3 ≤ 10 3x1 + 10x2 + 4x3 ≤9 X1, X2, X3 20 (final answer: Z=42.75, x₁=0, x2=0, x3 = 2.25)
Expert Solution
steps

Step by step

Solved in 6 steps with 15 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 for College Students
Algebra for College Students
Algebra
ISBN:
9781285195780
Author:
Jerome E. Kaufmann, Karen L. Schwitters
Publisher:
Cengage Learning