Distribution Plan to Minimize Cost. Consider the following network representation of a transportation problem:

An illustration shows a network problem for transportation. The origin nodes are Jefferson City with supply $30$ and Omaha with supply $20.$ The destination nodes are Des Moines with demand $25,$ Kansas City with demand $15,$ and Saint Louis with demand $10.$ Arcs labeled $14,16,$ and $7$ point from Jefferson City to Des Moines, Kansas City, and Saint Louis, respectively. Arrows labeled $8,10,$ and $5$ point from Omaha to Des Moines, Kansas City, and Saint Louis, respectively. The supplies, demands, and transportation costs per unit are shown on the network.

What is the optimal $($cost minimizing$)$ distribution plan? LO $1,2,3$

Details

The supplies, demands, and transportation costs per unit are shown on the network. What is the optimal $($cost minimizing$)$ distribution plan? LO $1,2,3$