Consider the following network representation of a transportation problem: Des Moines 30 14 20 20 Jefferson City 16 Kansas City 10 10 30 Omaha St. Louis 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. Jefferson City Des Moines Kansas City St.Louis Supply Omaha Demand 0 10 10 20 30 0 0 30 30 10 10 Total Cost: $470. 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". Jefferson City Omaha Total Cost: $ Des Moines Kansas City St.Louis

Consider the following network representation of a transportation problem: Des Moines 30 14 20 20 Jefferson City 16 Kansas City 10 10 30 Omaha St. Louis 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. Jefferson City Des Moines Kansas City St.Louis Supply Omaha Demand 0 10 10 20 30 0 0 30 30 10 10 Total Cost: $470. 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". Jefferson City Omaha Total Cost: $ Des Moines Kansas City St.Louis

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter5: Network Models

Section: Chapter Questions

Problem 53P

See similar textbooks