Consider the following network representation of a transportation problem: 20 30 Jefferson City Demand Omaha Jefferson City Omaha Total Cost: 16 Jefferson City Omaha 10 $ Supplies Demands The supplies, demands, and transportation costs per unit are shown on the network. The optimal (cost minimizing) distribution plan is given below. 0 25 25 Des Moines 25 10 Kansas City 5 15 Louis Des Moines Kansas City St.Louis Supply 10 20 0 10 15 10 Total Cost: $480. Find an alternative optimal solution for the above problem. If required, round your answer to nearest whole number and if your answer is zero enter "0". Des Moines Kansas City St.Louis 8 30
Consider the following network representation of a transportation problem: 20 30 Jefferson City Demand Omaha Jefferson City Omaha Total Cost: 16 Jefferson City Omaha 10 $ Supplies Demands The supplies, demands, and transportation costs per unit are shown on the network. The optimal (cost minimizing) distribution plan is given below. 0 25 25 Des Moines 25 10 Kansas City 5 15 Louis Des Moines Kansas City St.Louis Supply 10 20 0 10 15 10 Total Cost: $480. Find an alternative optimal solution for the above problem. If required, round your answer to nearest whole number and if your answer is zero enter "0". Des Moines Kansas City St.Louis 8 30
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
Related questions
Question
![Consider the following network representation of a transportation problem:
20
Jefferson
City
Omaha
Jefferson City
Omaha
Demand
Omaha
Jefferson City
Icon Key
14
Total Cost: $
16
10
3
Supplies
Demands
The supplies, demands, and transportation costs per unit are shown on the network. The optimal (cost minimizing) distribution plan is given below.
Des
M
Moines
0
25
25
Kansas
City
10
5
15
St.
Louis
Des Moines Kansas City St.Louis Supply
10
20
30
0
25
10
Total Cost: $480.
Find an alternative optimal solution for the above problem.
If required, round your answer to nearest whole number and if your answer is zero enter "0".
15
10
Des Moines Kansas City St.Louis](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fb5ec6077-aa40-48fc-b88b-4517daf9398a%2F7c169492-ab39-464c-b06d-aaf7e3a7e729%2Fzkj0dxv_processed.png&w=3840&q=75)
Transcribed Image Text:Consider the following network representation of a transportation problem:
20
Jefferson
City
Omaha
Jefferson City
Omaha
Demand
Omaha
Jefferson City
Icon Key
14
Total Cost: $
16
10
3
Supplies
Demands
The supplies, demands, and transportation costs per unit are shown on the network. The optimal (cost minimizing) distribution plan is given below.
Des
M
Moines
0
25
25
Kansas
City
10
5
15
St.
Louis
Des Moines Kansas City St.Louis Supply
10
20
30
0
25
10
Total Cost: $480.
Find an alternative optimal solution for the above problem.
If required, round your answer to nearest whole number and if your answer is zero enter "0".
15
10
Des Moines Kansas City St.Louis
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 7 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Practical Management Science](https://www.bartleby.com/isbn_cover_images/9781337406659/9781337406659_smallCoverImage.gif)
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,
![Practical Management Science](https://www.bartleby.com/isbn_cover_images/9781337406659/9781337406659_smallCoverImage.gif)
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,