Scribd
Upload
69 views

Modi Method

This document summarizes the Modi method for solving transportation problems. It provides an example problem with 4 sources and 3 destinations. The optimal solution is found using the Vogel's approximation method. It is then tested to be optimal by calculating the differences (dij) between the cell values (Cij) and the row (ui) and column (vj) totals for each unoccupied cell. All differences are greater than 0, confirming the original solution is optimal with a minimum total cost of 796.

Uploaded by

kkarpagam
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
69 views

Modi Method

This document summarizes the Modi method for solving transportation problems. It provides an example problem with 4 sources and 3 destinations. The optimal solution is found using the Vogel's approximation method. It is then tested to be optimal by calculating the differences (dij) between the cell values (Cij) and the row (ui) and column (vj) totals for each unoccupied cell. All differences are greater than 0, confirming the original solution is optimal with a minimum total cost of 796.

Uploaded by

kkarpagam
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 10

Transportation Problem Using Modi Method

K Karpagam
Assistant Professor of Mathematics
PG & Research Department of Mathematics
Sri Ramakrishna College of Arts & Science, Coimbatore
MODI METHOD (Modified Distribution Method)
Test for Optimal Solution
1. Solve the transportation problem and find the Optimal Solution
1 2 3 4 Supply
A 21 16 25 13 11
B 17 18 14 23 13
C 32 27 18 41 19
Demand 6 10 12 15

Solution :
∑ ai = 11 + 13 + 19 = 43
∑ bj = 6 + 10 + 12 + 15 = 43
= > ∑ ai = ∑ b j .
Hence it is a Balanced T.P .
By VAM ,

11
(3)
21 16 25 13 11

(3)
17 18 14 23 13

(9)
32 27 18 41 19

4
6 10 12 15

(4) (2) (4) (10)


4
9 (3)
17 18 14 23 13

(9)
32 27 18 41 19

6 10 12 4

(15) (9) (4) (18)


6
3 (3)
17 18 14 9

(9)
32 27 18 19

6 10 12

(15) (9) (4)


(4)
18 14 3
12
7 (9)
27 18 19

10 12

(9) (4)

18 3 (18)
7

27 7 (27)

3
10

(9)
3

18 3

11
3
21 16 25 13 11
6 3 4

17 18 14 23 13
7 12

32 27 18 41 19

6 10 12 15

Cost = (11×13) + (6×17) + (3×18) + (4×23) + (7×27) + (12×18)


= 143 + 102 + 54 + 92 + 189 + 216
= 796.
To find Optimal Solution :
m + n – 1 = 3 + 4 – 1 = 6 where m = number of rows , n = number of columns.
dij = Cij – (ui + vj ) = > unoccupied cells
Cij = ui + vj = > occupied cells

11

21 16 25 13 u1 = -10
6 3 4

17 18 14 23 u2 = 0
7 12

32 27 18 41 u3 = 9

v1 = 17 v2 = 18 v3 = 9 v4 = 23
Cij = ui + vj where ( i = row ) , ( j = column )
C14 = u1 + v4 C21 = u2 + v1 C22 = u2 + v2 C24 = u2 + v4 C32 = u3 + v2
13 = u1 + 23 17 = 0 + v1 18 = 0 + v2 23 = 0 + v4 27 = u3 + 18
u1 = -10 v1 = 17 v2 = 18 v4 = 23 u3 = 9

C33 = u3 + v3
18 = 9 + v3
v3 = 9
For unoccupied cells :
dij = Cij – (ui + vj)
d11 = C11 – (u1 + v1) d12 = C12 – (u1 + v2) d13 = C13 – (u1 + v3)
d11 = 21 – (-10 + 17) d12 = 16 – (-10 + 18) d13 = 25 – (-10 + 9)
d11 = 21 – 7 d12 = 16 – 8 d13 = 25 + 1
d11 = 14 d12 = 8 d13 = 26

d23 = C23 – (u2 + v3) d31 = C31 – (u3 + v1) d34 = C34 – (u3 + v4)
d23 = 14 – (0 + 9) d31 = 32 – (9 + 17) d34 = 41 – (9 + 23)
d23 = 14 – 9 d31 = 32 – 26 d34 = 41 – 32
d23 = 5 d31 = 6 d34 = 9
11
(14) (8) (26)
16 25 13
21
6 3 4
(5)
18 14 23
17
7 12
(6) (9)
32 27 18 41

dij > 0 ; The given solution is Optimum (minimum)


Cost = (11×13) + (6×17) + (3×18) + (4×23) + (7×27) + (12×18)
= 143 + 102 + 54 + 92 + 189 + 216
= 796.

You might also like