Question: Problem b-02 (Algorithmic) Consider the following network representation of a transportation problem: Des Mouses 150 84 1101 Tee 18 90 60 130 Os 8. Loom

Problem b-02 (Algorithmic) Consider the following

Problem b-02 (Algorithmic) Consider the following network representation of a transportation problem: Des Mouses 150 84 1101 Tee 18 90 60 130 Os 8. Loom 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. Ir constant is "1", it must be entered in the bo Let xy = amount shipped from supply node i to demand node. Min 84 X111 + 54X121- 42x131+ 48x21+ 60x221 30x23 S.L. 1 X11+ 1 X12 1 *13 180 1x21+ 1 X22+ 1 x 120 1 X11 1 X21 150 112 1 x22 90 1 x13 1x231= 60 X21, X12, X23. 21. 22. 230 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

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!