61 Des Moines 14 84 Jefferson City 16 7 Kansas 51 City 8 10 74 Omaha 5 St. Louis 46 Supplies Demands X 11 The supplies, demands, and transportation costs per unit are shown on the network. The optimal (cost minimizing) distribution plan is given below. (Assume x. = amount shipped from Jefferson City to Des Moines, X12 = amount shipped from Jefferson City to Kansas City, X13 = amount shipped from Jefferson City to St. Louis, X21 = amount = amount shipped from Omaha to Des Moines, X22 shipped from Omaha to Kansas City, and X23 = amount shipped from Omaha to St. Louis.) Des Moines Kansas City St. Louis Supply Jefferson City 38 0 46 84 Omaha 23 51 0 74 Demand 61 51 46 Use the procedure described in Section 12.7 to try to find an alternative optimal solution. (Round your answers to the nearest integer.) (X11, X12, X13, X21, X22, X23) = 61 Des Moines 14 84 Jefferson City 16 7 Kansas 51 City 8 10 74 Omaha 5 St. Louis 46 Supplies Demands X 11 The supplies, demands, and transportation costs per unit are shown on the network. The optimal (cost minimizing) distribution plan is given below. (Assume x. = amount shipped from Jefferson City to Des Moines, X12 = amount shipped from Jefferson City to Kansas City, X13 = amount shipped from Jefferson City to St. Louis, X21 = amount = amount shipped from Omaha to Des Moines, X22 shipped from Omaha to Kansas City, and X23 = amount shipped from Omaha to St. Louis.) Des Moines Kansas City St. Louis Supply Jefferson City 38 0 46 84 Omaha 23 51 0 74 Demand 61 51 46 Use the procedure described in Section 12.7 to try to find an alternative optimal solution. (Round your answers to the nearest integer.) (X11, X12, X13, X21, X22, X23) =