Question:

Problem 6-02 (Algorithmic)

Consider the following network representation of a transportation problem:

Thank you. (Resubmitted with clearer snapshot.)

Problem 6-02 (Algorithmic) Consider the following network representation of a transportation problem: Des Moines ) 375 210 450 / Jefferson 135 City 105 120 Kansas City 225 150 300 Omaha St. Louis 150 Supplies Demands The supplies, demands, and transportation costs per unit are shown on the network. a. Develop a linear programming model for this problem; be sure to define the variables in your model. If constant is "1", it must be entered in the box. Let Xij = amount shipped from supply node i to demand nodej. The supplies, demands, and transportation costs per unit are shown on the network. a. Develop a linear programming model for this problem; be sure to define the variables in your model. If constant is "1", it must be entered in the box. Let Xij = amount shipped from supply node i to demand node j. Min C *11+ x12+C *13+ x21+ x22+ X21 x2 IIII X22 X11, X12, X13, X21, X22, X23 > 0 b. Solve the linear program to determine the optimal solution. Enter "O" if your answer is zero. Quantity 3 00 cost $ Jefferson City - Des Moines C Jefferson City - Kansas City Jefferson City - St. Louis Omaha - Des Moines Omaha - Kansas City Omaha - St. Louis Total Cost