Solve the following linear programming problem: minimize Z = 3.x1+ 12x12 + 8x13 + 10x21 + 5x22 +6x23 + 6x31 + 7x32 + 10x33 subject to X|1 + x12 + x 13 X21 + x22 + X 23 90 30 100 X31 + X32 + X 33 X11 + x21 + X31 < 70 + X22 X12 X 32 < 110 X13 X 23 X 33 S 80 Xij 2 0

Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter11: Simulation Models
Section: Chapter Questions
Problem 68P
icon
Related questions
Question
Solve the following linear programming problem:
minimize Z = 3x|1+ 12x12 + 8x13 + 10x21 + 5x22 + 6x23 + 6x31 + 7x32 + 10x33
subject to
X11 +x12 + X13 = 90
30
x21 + x22 + X 23
X31 + x32 + x 33
+ x31 < 70
X12 + x22 + X 32 < 110
X13 + x23 + X33 < 80
Xij 2 0
%3D
100
X11
X21
Transcribed Image Text:Solve the following linear programming problem: minimize Z = 3x|1+ 12x12 + 8x13 + 10x21 + 5x22 + 6x23 + 6x31 + 7x32 + 10x33 subject to X11 +x12 + X13 = 90 30 x21 + x22 + X 23 X31 + x32 + x 33 + x31 < 70 X12 + x22 + X 32 < 110 X13 + x23 + X33 < 80 Xij 2 0 %3D 100 X11 X21
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 4 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,