Consider the following network representation of a transportation problem. 45 25 Supplies Jefferson City Omaha 16 D 8 co
-
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am
Consider the following network representation of a transportation problem. 45 25 Supplies Jefferson City Omaha 16 D 8 co
30
10
30
16
9
8
8
11
25
A network diagram between five locations is shown. The left-handside of the graph is labeled "Supplies" and lists Jefferson Cityand Omaha. The right-hand side of the graph is labeled "Demands"and lists Des Moines, Kansas City, and St. Louis. Lines are shownbetween various locations. The following list contains the numbersplaced on the graph.
The supplies, demands, and transportation costs per unit areshown on the network.
(a)
Develop a linear programming model for this problem; be sure todefine the variables in your model.
Let
x11, x12, x13, x21, x22, x23 ≥ 0
(b)
Solve the linear program to determine the optimal solution.
Consider the following network representation of a transportation problem. 45 25 Supplies Jefferson City Omaha 16 D 8 co 8 11 25 Des Moines Kansas City St. Louis 30 10 30 Demands