Bussiness analytics

Consider the following network representation of a transportation problem:

A network representation of a transportation problem has 5 distribution centers and 6 distribution routes. Each origin and each destination is represented by a node and each possible shipping route is represented by an arc. The goods shipped from the origins to the destinations represent the flow in the network and the direction of flow (from origin to destination) is indicated by arrows. The Jefferson City node is the start of three arrows to nodes Des Moines, Kansas City, and St. Louis with the transportation costs per unit being 14 dollars, 16 dollars, and 7 dollars, respectively. The Omaha node is the start of three arrows to nodes Des Moines, Kansas City, and St. Louis with the transportation costs per unit being 8 dollars, 10 dollars, and 5 dollars, respectively. The amount of supply is written next to each origin node, and the amount of demand is written next to each destination node. There is a capacity of 30 units at Jefferson City and 20 units at Omaha. The nodes Des Moines, Kansas City, and St. Louis have demand values of 25, 15, and 10, respectively.

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	0	10	30
Omaha	5	15	0	20
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
Omaha

Total Cost: $ .