MATH UHH Q1 (PLEASE ANSWER THE QUESTION BELOW ONLY, DON'T COPY IRRELEVANT ANSWER FROM OTHER CHEGG ANSWER)

1. [-/5.45 Points] DETAILS ASWMSCI15 6.E.002. Consider the following network representation of a transportation problem. 20 Des Moines 60 Jefferson City 9 Kansas City 15 Omaha 25 A 26 St. Louis 50 Supplies Demands The supplies, demands, and transportation costs per unit are shown on the network. 8 11 MY NOTES ASK YOUR TEACHER PRACTICE ANOTHER (a) Develop a linear programming model for this problem; be sure to define the variables in your model. Let X amount shipped from Jefferson City Des Moines X12 = amount shipped from Jefferson City to Kansas City X13 amount shipped from Jefferson City to St. Louis X21 amount shipped from Omaha to Des Moines X22 = amount shipped from Omaha to Kansas City X23 amount shipped from Omaha to St. Louis Min *11 + X12 + X13 + 21 +2+ [ X23 s.t. X11 + X12 + 13 X21 X22 + X11 X21 X12 X22 X13 X11 X12, X131 X211 X221 X23 20 (b) Solve the linear program to determine the optimal solution. Amount Cost Jefferson City-Des Moines Jefferson City-Kansas City Jefferson City-St. Louis Omaha-Des Moines Omaha-Kansas City Omaha-St. Louis Total X23 X23 =