Solve the following LP to obtain the optimal solution using Minimize Z= 10 X1 + 16 X2 + 8 X3 2X1 + 3X2 + X3 ≥ 60 2X1 + X2 + 3X3 ≤ 45 X1 + X2 + X3 ≥ 20 S.T. X1, X2, X3 20

Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter5: Network Models
Section5.5: Shortest Path Models
Problem 32P
icon
Related questions
Question

Y9

5) Solve the following LP to obtain the optimal solution using Dual Simplex Algorithm.
Minimize Z = 10 X1 + 16 X2 + 8 X3
2X1 + 3X2 + X3 ≥ 60
2X1 +
X2 + 3X3 ≤ 45
X1 +
X2 + X3 ≥ 20
S.T.
X1, X2, X3 20
Transcribed Image Text:5) Solve the following LP to obtain the optimal solution using Dual Simplex Algorithm. Minimize Z = 10 X1 + 16 X2 + 8 X3 2X1 + 3X2 + X3 ≥ 60 2X1 + X2 + 3X3 ≤ 45 X1 + X2 + X3 ≥ 20 S.T. X1, X2, X3 20
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Practical Management Science
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,