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

1. [-/11.11 Points] DETAILS ASWMSCI15 6.E.002. Consider the following network representation of a transportation problem. Des Moines 14 35 Jefferson City Kansas City 40 Omaha 26 St. Louis Supplies The supplies, demands, and transportation costs per unit are shown on the network. 10 8 8 11 20 10 Demands 4 MY NOTES ASK YOUR TEACHER (a) Develop a linear programming model for this problem; be sure to define the variables in your model. Let X11 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 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 + *22 + X23 s.t. + + + X11 X21 X21 X11 + *12 X13 X11 12 13 X211 X221 X230 (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 X12 Total X13 + X22 *22 + X23 X23 S S = =