1 of 4

http://cbom.atozmath.com/CBOM/CBOMSol.aspx?c=VAM&CVal=...

Print This Solution Close This Solution

Find Solution of Transportation Problem Using Voggel's Approximation Method
TOTAL no. of supply constraints : 2
TOTAL no. of demand constraints : 5
Problem Table is
D

Supply

1122 3267 2783 2880 3024 30

2175 4089 3467 3219 1476 42

1
2

Demand 15

13

17

16

11

Table-1
D

Supply Row Penalty

1122 3267 2783 2880 3024 30

1661 |

2175 4089 3467 3219 1476 42

699 |

Demand

15

1
2

13

Col Penalty 1053 822

17

16

11

684

339

1548

The maximum penalty, 1661, occurs in row S .

1

Allocate At [1][1] = 15
The minimum Cij in this row is C

11

= 1122.

The maximum allocation in this cell is 15.

It satisfy demand of D and adjust the supply of S from 30 to 15 (30 - 15 = 15).
1

Table-2
D

Supply Row Penalty

1122(15) 3267 2783 2880 3024 15

1661 | 97 |

S2

2175

4089 3467 3219 1476 42

699 | 1743 |

Demand

13

17

16

11

Col Penalty

1053
--

822
822

684
684

339
339

1548
1548

The maximum penalty, 1743, occurs in row S2.

Allocate At [2][5] = 11
The minimum Cij in this row is C

25

= 1476.

The maximum allocation in this cell is 11.

It satisfy demand of D and adjust the supply of S from 42 to 31 (42 - 11 = 31).
5

Table-3
D

Supply Row Penalty

02-May-16 10:58 PM

2 of 4

http://cbom.atozmath.com/CBOM/CBOMSol.aspx?c=VAM&CVal=...

1122(15) 3267 2783 2880 3024

15

1661 | 97 | 97 |

2175

4089 3467 3219 1476(11)

31

699 | 1743 | 248 |

Demand

13

17

16

822
822
822

684
684
684

339
339
339

1548
1548
--

1
2

1053
Col Penalty ---

The maximum penalty, 822, occurs in column D2.

Allocate At [1][2] = 13
The minimum Cij in this column is C

12

= 3267.

The maximum allocation in this cell is 13.

It satisfy demand of D and adjust the supply of S from 15 to 2 (15 - 13 = 2).
2

Table-4
D

Supply Row Penalty

1122(15) 3267(13) 2783 2880 3024

1661 | 97 | 97 | 97 |

S2

2175

4089

3467 3219 1476(11)

31

699 | 1743 | 248 | 248 |

Demand

17

16

822
822
822
--

684
684
684
684

339
339
339
339

1548
1548
---

1053
-Col Penalty
---

The maximum penalty, 684, occurs in column D .

3

Allocate At [1][3] = 2
The minimum Cij in this column is C

13

= 2783.

The maximum allocation in this cell is 2.

It satisfy supply of S and adjust the demand of D from 17 to 15 (17 - 2 = 15).
1

Table-5
D1

D2

D3

D4

D5

Supply Row Penalty

1122(15) 3267(13) 2783(2) 2880 3024

2175

4089

3467

3219 1476(11) 31

Demand

15

16

822
822
822
---

684
684
684
684
3467

339
339
339
339
3219

1548
1548
----

1
2

1053
-Col Penalty ----

1661 | 97 | 97 | 97 | -- |
699 | 1743 | 248 | 248 | 248 |

The maximum penalty, 3467, occurs in column D .

3

Allocate At [2][3] = 15

02-May-16 10:58 PM

3 of 4

http://cbom.atozmath.com/CBOM/CBOMSol.aspx?c=VAM&CVal=...

The minimum Cij in this column is C

23

= 3467.

The maximum allocation in this cell is 15.

It satisfy demand of D and adjust the supply of S from 31 to 16 (31 - 15 = 16).
3

Table-6
D

Supply Row Penalty

1122(15) 3267(13) 2783(2)

2175

4089

3467(15) 3219 1476(11)

Demand

16

822
822
822
----

684
684
684
684
3467
--

339
339
339
339
3219
3219

1548
1548
-----

1
2

1053
--Col Penalty
----

2880 3024

1661 | 97 | 97 | 97 | -- | -- |

16

699 | 1743 | 248 | 248 | 248 | 3219 |

The maximum penalty, 3219, occurs in row S .

2

Allocate At [2][4] = 16
The minimum Cij in this row is C

24

= 3219.

The maximum allocation in this cell is 16.

It satisfy supply of S and adjust the demand of D from 16 to 0 (16 - 16 = 0).
2

Final Allocation Table is

D

S1

1122(15) 3267(13) 2783(2)

2175

4089

3467(15) 3219(16) 1476(11)

Demand

15

13

17

16

11

822
822
822
----

684
684
684
684
3467
--

339
339
339
339
3219
3219

1548
1548
-----

1053
--Col Penalty
----

2880

3024

Supply Row Penalty

30

1661 | 97 | 97 | 97 | -- | -- |

42

699 | 1743 | 248 | 248 | 248 | 3219 |

Here, the number of allocation is equal to m + n - 1 = 2 + 5 - 1 = 6

The solution is feasible.
Total Transportation cost = 1122 15 + 3267 13 + 2783 2 + 3467 15 + 3219 16 + 1476 11 = 184612
The minimized total transportation cost = 184612
Now modi method starts....
Find Ui and Vj, Cij = Ui + Vj, for all occupied cells(i,j)
Substituting, U = 0, we get
1

C
C

11
12

= U + V 1122 = 0 + V V = 1122 - 0 = 1122

1

= U + V 3267 = 0 + V V = 3267 - 0 = 3267

1

02-May-16 10:58 PM

4 of 4

http://cbom.atozmath.com/CBOM/CBOMSol.aspx?c=VAM&CVal=...

C13 = U1 + V3 2783 = 0 + V3 V3 = 2783 - 0 = 2783

C
C

23
24

= U + V 3467 = U + 2783 U = 3467 - 2783 = 684

2

= U + V 3219 = 684 + V V = 3219 - 684 = 2535

2

C25 = U2 + V5 1476 = 684 + V5 V5 = 1476 - 684 = 792

D

1122 (15) 3267 (13) 2783 (2)

2175

2880

Supply Ui

3024

30

4089

3467 (15) 3219 (16) 1476 (11) 42

Demand 15

13

17

16

11

Vj

3267

2783

2535

792

1122

0
684

Find Dij, Dij = Cij - (Ui + Vj), for all unoccupied cells(i,j)
D = C - (U + V ) = 2880 - (0 + 2535) = 345
14

D
D

15
21

14

=C
=C

15
21

- (U + V ) = 3024 - (0 + 792) = 2232

1

- (U + V ) = 2175 - (684 + 1122) = 369

2

D22 = C22 - (U2 + V2) = 4089 - (684 + 3267) = 138

D

3267 (13)

2783 (2)

1122 (15)

2175 [369] 4089 [138] 3467 (15) 3219 (16)

1
2

2880 [345] 3024 [2232] 30

1476 (11)

Demand 15

13

17

16

11

Vj

3267

2783

2535

792

1122

Supply Ui

42

0
684

Since all Dij>=0. So final solution is arrived.

D1

D2

D3

1122 (15) 3267 (13) 2783 (2)

2175

1
2

Demand 15

D4

D5

Supply

2880

3024

30

4089

3467 (15) 3219 (16) 1476 (11) 42

13

17

16

11

Here, the number of allocation is equal to m + n - 1 = 2 + 5 - 1 = 6

The solution is feasible.
Total Transportation cost = 1122 15 + 3267 13 + 2783 2 + 3467 15 + 3219 16 + 1476 11 = 184612
The minimized total transportation cost = 184612

Solution is provided by AtoZmath.com

02-May-16 10:58 PM