Q1) Canning Transport is to move goods from 3 factories to 3 distribution centers. Information about move is given below. Design network diagram. Use either Linear Programming module or Transportation module of Cd to minimize the shipping costs involved in move.
|
Source
|
Supply
|
Destination
|
Demand
|
|
A
|
200
|
X
|
50
|
|
B
|
100
|
Y
|
125
|
|
C
|
150
|
Z
|
100
|
Shipping costs are:
|
|
Destination
|
|
Source
|
X
|
Y
|
Z
|
|
A
|
3
|
2
|
5
|
|
B
|
9
|
10
|
6
|
|
C
|
5
|
6
|
9
|
i) In optimal solution, determine total shipping cost?
ii) In optimal solution, what quantity of goods will be shipped from Source A to Destination Z?