Question

Consider the following network representation of a transportation problem: Des Moines 25 30 Jefferson City Kansas City 115 20 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. Des Moines Kansas City St.Louis Supply Jefferson City 20 10 30 Omaha 5 15 Demand | 25 15 10 Total Cost: $540. Find an alternative optimal solution for the above problem. If your answer is zero, enter "0". Des Moines Kansas City St.Louis Jefferson City 20 Do 100 Omaha 20 15 00 Total Cost: $ 540 .

Answer 1

Solutions Given that Des 1 moines) 25 30 Jefferson R 16 city (kansas) 15 citu 20 (omaha Vsti Louis Supplies Demands The supplies, demands, and transportation costs per unit are shown on the network. An alternative optimal solution is: Des Moines Kansas St. Louis Supply 16 17 Omaha 1 10 15 | 20 25 15. . 10 Jefferson tecity Demand

we will apply the Vam method 14 16 70 74/30.20 &1053 20 6 62 25 15 TO 14 gree 16 21 20 10220 -25 eur S 140 169 20 5. 15 kansas City St. Louis moines I 5 . 15 Jefferson. city Omaha

Therefore, Total cost = 5X14 + 15X16 +7X10+ 20X8 +0+0 : Total cost = 540 and also as the assignment don't have any cycle. It is optimal.