Question:

Problem 6-02 (Algorithmic)

Consider the following network representation of a transportation problem:

Problem 6-02 (Algorithmic) Consider the following network representation of a transportation problem: Des Moines) 375 210 450/ Jeffer Jefferson City 135 105 120 X Kas City 225 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 xy = amount shipped from supply node i to demand nodej. x11 x 12 + 13 +L X1, X12, X13, X21. X22X23 20 b. Solve the linear program to determine the optimal solution. Enter "o" if your answer is zero. Quantity cost $ Jefferson City - Des Moines Jefferson City - Kansas City Jefferson City - St. Louis Omaha - Des Moines Omaha - Kansas City Omaha - St. Louis Total Cost Problem 6-02 (Algorithmic) Consider the following network representation of a transportation problem: Des Moines) 375 210 450/ Jeffer Jefferson City 135 105 120 X Kas City 225 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 xy = amount shipped from supply node i to demand nodej. x11 x 12 + 13 +L X1, X12, X13, X21. X22X23 20 b. Solve the linear program to determine the optimal solution. Enter "o" if your answer is zero. Quantity cost $ Jefferson City - Des Moines Jefferson City - Kansas City Jefferson City - St. Louis Omaha - Des Moines Omaha - Kansas City Omaha - St. Louis Total Cost