Question: Let Xjk be the units transported from node-j to node-k for all possible (j, k) pair. j=1(Jefferson City),2(Omaha) and k=1(Des Moines),2(Kansas City),3(St.Louis) Minimize Z =

Let Xjk be the units transported from node-j to node-k for all possible (j, k) pair. j=1(Jefferson City),2(Omaha) and k=1(Des Moines),2(Kansas City),3(St.Louis)

Minimize Z = 14 X11 + 9 X12 + 7 X13 + 8 X21 + 10 X22 + 5 X23

Subject to, X11 + X12 + X13 <= 30 (Capacity of Jefferson City)

X21 + X22 + X23 <= 20 (Capacity of Omaha)

X11 + X21 = 25 (Demand at Des Moines)

X12 + X22 = 15 (Demand at Kansas city)

X13 + X23 = 10 (Demand at St.Louis)

Xjk >= 0 for all possible (j, k) pair

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!