3.0.25 4.0.33 5. 0.00 O Consider the following network representation of a transportation problem: 20 30 Omaha Jefferson City Demand Omaha Jefferson City Jefferson City Omaha Total Cost: $ Incorrect Hide Feedback Supplies The supplies, demands, and transportation costs per unit are shown on the network. The optimal (cost minimizing) distribution plan is given below. 0 460 30 30 16 10 S 0 30 Des Moines Kansas City St.Louis Supply Des Moines Kansas City 10 * 0 * 10 Des Moines Kansas City 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". 9 St. Louis 0 10 0 10 30 10 Demands 10 9 1 20 30 St.Louis *

Consider the following network representation of a transportation probiem: The supplies, demands, and transportation costs per unit are shown on the network. The optima Total Costi $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 ". Total Cost: $ (