Consider the following network representation of a transportation problem: Des Moines 475 266 Jefferson 570 171 City 133 Kansas 152, 285 City 190 380 Omaha 95 St. Louis 190 Supplies Demands The supplies, demands, and transportation costs per unit are shown on the network. a. Develop a linear programming model for this problem; be sure to define the variables in your model. If constant is "1", it must be entered in the Let xij = amount shipped from supply node i to demand node j. Min 266 X11+ 171 X12+ 133 x13 + 152 X21+ 190 x22 + 95 X23 s.t. 1 x11+ 1 x12 + 1 x13 570 1 x21 + 1 x22 + 1 x23S 380 1 x11 1 X21 1 X12 1 X22 1 1 X13 + 1 X23 1 X11, X12, Х13, X21, X22, X23 2 0 b. Solve the linear program to determine the optimal solution. Enter "0" if your answer is zero. Quantity Cost Jefferson City - Des Moines 2$ Jefferson City - Kansas City Jefferson City - St. Louis Omaha - Des Moines Omaha - Kansas City

Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter5: Network Models
Section: Chapter Questions
Problem 72P
icon
Related questions
Question
100%

Consider the following network representation of a transportation problem:

Consider the following network representation of a transportation problem:
Des Moines
475
266
Jefferson
570
171
City
133
Kansas
152
285
City
190
380
Omaha
95
St. Louis
190
Supplies
Demands
The supplies, demands, and transportation costs per unit are shown on the network.
a. Develop a linear programming model for this problem; be sure to define the variables in your model. If constant is "1", it must be entered in the box.
Let xij = amount shipped from supply node i to demand node j.
Min
266 x11 +
171 x12 +
133 x13 +
152 x21+
190 x22|+
95 x23
s.t.
X11+
1 X12 +
1
X13
570
1.
X21+
1 x22 +
1 x23<
380
1 x11
1 x21
1
1 x12
1 x22
1
=
1 x13
1 x23 =
1
X11, X12, X13, X21, X22, X23 2 0
b. Solve the linear program to determine the optimal solution. Enter "0" if your answer is zero.
Quantity
Cost
Jefferson City - Des Moines
Jefferson City - Kansas City
Jefferson City - St. Louis
Omaha - Des Moines
Omaha - Kansas City
Transcribed Image Text:Consider the following network representation of a transportation problem: Des Moines 475 266 Jefferson 570 171 City 133 Kansas 152 285 City 190 380 Omaha 95 St. Louis 190 Supplies Demands The supplies, demands, and transportation costs per unit are shown on the network. a. Develop a linear programming model for this problem; be sure to define the variables in your model. If constant is "1", it must be entered in the box. Let xij = amount shipped from supply node i to demand node j. Min 266 x11 + 171 x12 + 133 x13 + 152 x21+ 190 x22|+ 95 x23 s.t. X11+ 1 X12 + 1 X13 570 1. X21+ 1 x22 + 1 x23< 380 1 x11 1 x21 1 1 x12 1 x22 1 = 1 x13 1 x23 = 1 X11, X12, X13, X21, X22, X23 2 0 b. Solve the linear program to determine the optimal solution. Enter "0" if your answer is zero. Quantity Cost Jefferson City - Des Moines Jefferson City - Kansas City Jefferson City - St. Louis Omaha - Des Moines Omaha - Kansas City
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 3 images

Blurred answer
Recommended textbooks for you
Practical Management Science
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,