Question: Problem 6-02 (Algorithmic) Consider the following network representation of a transportation problem: Des Moines 375 210 450 Jefferson City 135 105 120 Kansas City 225

Problem 6-02 (Algorithmic) Consider the followingProblem 6-02 (Algorithmic) Consider the following

Problem 6-02 (Algorithmic) Consider the following network representation of a transportation problem: Des Moines 375 210 450 Jefferson City 135 105 120 Kansas City 225 150 300 Omaha 75 St. Louis 150 1 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 node j. Min 210 X11 + 135 x12 + 105 X13+ 120 x21+ 150 X22 + 75 x23 s.t. 1 *11+ 1 *12 1 X13 450 1 x21 + 1 x22 1 X233 300 1 x11 + 1 X21 375 1 x12 + 1 X22 225 1 X13 1 X231= 150 X11, X12, X13, X21, 22, 23 20 b. Solve the linear program to determine the optimal solution. Enter "0" 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 $

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!