Problem: Consider a transshipment problem consisting of three origin nodes, two transshipment nodes, and four destination nodes. The supplies at the origin nodes and the demands at the destination nodes are as follow:
Origin Supply Destination Demand
1 400 1 200
2 450 2 500
3 350 3 300
4 200
The shipping costs per unit ($) are provided in the follwoing table:
|
|
|
|
|
|
|
To
|
|
|
|
|
|
From
|
|
|
|
Transshipment
|
|
Destination
|
|
|
|
|
|
1
|
2
|
|
1
|
2
|
3
|
4
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Origin
|
1
|
|
|
6
|
8
|
|
-
|
-
|
-
|
-
|
|
|
2
|
|
|
8
|
12
|
|
-
|
-
|
-
|
-
|
|
|
3
|
|
|
10
|
5
|
|
-
|
-
|
-
|
-
|
|
Transshipment
|
1
|
|
|
-
|
-
|
|
9
|
7
|
6
|
10
|
|
|
2
|
|
|
-
|
-
|
|
7
|
9
|
6
|
8
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1) Draw the network representation of this problem
2) Formulate the appropriate linear programming problem
3) Solve for the optimal solution