Question: please answer in the same format. Thank you. Consider the following network representation of a transportation problem: Des Moines) 200 112 740 Jefferson City 72

please answer in the same format. Thank you.please answer in the same format. Thank you.

Consider the following network representation of a transportation problem: Des Moines) 200 112 740 Jefferson City 72 56 Kansas City 120 80 160 Omaha 40 St. Louis SO 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 X11 + x12 + X13 + *21 + X22 + X23 s.t. X11 + X12+ X13 x21 + X22 + X23 X11 + X21 X12 + X22 X13 X23= X11, X12, X13, 21, 22, 23 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 $

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!