Professional Documents
Culture Documents
(Spring19) - MTL 103 Tut7a
(Spring19) - MTL 103 Tut7a
(Spring19) - MTL 103 Tut7a
Transportation Problems
1. Solve the following cost minimization transportation problem (CMTP):
D1 D2 D3 D4 D5 D6 ai
S1 3 5 6 0 2 8 15
S2 1 3 7 2 1 9 12
S3 2 4 5 1 3 6 13
S4 4 2 4 2 4 7 8
S5 3 1 8 3 2 5 27
bj 10 5 7 18 25 10
2. The following table give the cost of transporting material from supply points A, B, C, D to demand
points
D1 D2 D3 D4 D5 ai
A 8 10 12 17 15 100
B 15 13 18 11 9 150
C 14 20 6 10 13 180
D 13 19 7 5 12 190
bj 90 170 50 120 190
The present allocation is as follows:
x11 = 90, x12 = 10, x22 = 150, x32 = 10, x33 = 50, x35 = 120, x44 = 120, x45 = 70. Check if this allocation
is optimal. If not, find optimal schedule.
3. Consider the following time minimization TP in which the time tij to deliver the goods from source i to
destination j is given, find optimal schedule:
D1 D2 D3 D4 D5 ai
S1 15 18 20 25 30 40
S2 25 20 15 10 20 20
S3 18 15 25 30 15 30
S4 3 8 15 10 20 60
bj 20 30 10 50 40