$414/15$

Consider the following network representation of a transportation problem.

Supplies

Demands

$($i$)$

The supplies, demands, and transportation costs per unit are shown on the network. What is the optima!l $($cost minimizing$)$ distribution plan?

$\backslash$table$[[,$Amount,Cost$],[$Jefferson City$-$Des Moines,,$],[$Jefferson City$-$Kansas City,,$],[$Jefferson City$-$St$.$ Louis,,$],[$Omaha$-$Des Moines,,$],[$Omaha$-$Kansas City,,$],[$Omaha$-$St$.$ Louis Total,,$]]$