$[-/12\mathrm{.}5$ Points$]$

MY NOTES

ASK YOUR TEACHER

PRACTICE ANOT

Consider the following network representation of a transportation problem.

$$ shipped from Jefferson City to St$.$ Louis, $x_{21}=$ amount shipped from Omaha to Des Moines, $x_{22}=$ amount shipped from Omaha to Kansas City, and $x_{23}=$ amount shipped from Omaha to St$.$ Louis.$)$

$\backslash$table$[[,$Des Moines,Kansas City,St$.$ Louis,Supply$],[$Jefferson City,,$0,42,78],[$Omaha$,21,47,0,68],[$Demand$,57,47,42,]]$

Use the procedure described in Section $12\mathrm{.}7$ to try to find an alternative optimal solution. $($Round your answers to the nearest integer.$)$

$(1){?}^{81}1F$