Vogel Approximation Method
The Vogel approximation (Unit penalty)
method is an iterative procedure for
computing a basic feasible solution of a
transportation problem. This method is
preferred over the two methods discussed
in the previous sections, because the initial
basic feasible solution obtained by this
method is either optimal or very close to
the optimal solution.
Steps
The standard instructions are paraphrased below:
1.Identify the boxes having minimum and next to minimum
transportation cost in each row and write the difference (penalty)
along the side of the table against the corresponding row.
2.Identify the boxes having minimum and next to minimum
transportation cost in each column and write the difference (penalty)
against the corresponding column
3.Identify the maximum penalty. If it is along the side of the table,
make maximum allotment to the box having minimum cost of
transportation in that row. If it is below the table, make maximum
allotment to the box having minimum cost of transportation in that
column.
4.If the penalties corresponding to two or more rows or columns are
equal, you are at liberty to break the tie arbitrarily.
5.Repeat the above steps until all restrictions are satisfied.
Example 1 Vogel's approximation method
Consider the transportation problem presented in the following table:
Destination
Origin 1 2 3 4 Supply
1 20 22 17 4 120
2 24 37 9 7 70
3 32 37 20 15 50
Demand 60 40 30 110 240
Calculate the penalties first row wise then column wise
Destination
Suppl
Origin 1 2 3 4
y Penalty
1 20 22 17
17 44 120 13
2 24 37 9 7
7
70 2
9
3 32 37 20 15 50 5
20 15
Dema
60 40 30 110 240
nd
Penalt
y 4 15 8 3
The highest penalty occurs in the second column. The minimum cost in
this column is c12 (i.e., 22). So x12 = 40 and the second column is
eliminated.
Destination
Origin 1 2 3 4 Supply Penalty
80
40
1 20 22
22 17 4 120 13
2 24 37 9 7 70 2
3 32 37 20 15 50 5
Demand 60 40 30 110 240
Penalty 4 15 8 3
Now again calculate the penalty
Origin 1 3 4 Supply Penalty
80
1 20 17 4 80 13
2 24 9 7 70 2
3 32 20 15 50 5
30
Demand 60 30 110
Penalty 4 8 3
The highest penalty occurs in the first row. The minimum cij
in this row is c14 (i.e., 4). So x14 = 80 and the first row is
eliminated.
Again we obtain penalties for this reduced matrix
Origin 1 3 4 Supply Penalty
30 40
2 24 9 7 70 2
3 32 20 15 50 5
Demand 60 30 30
Penalty 8 11 8
The highest penalty occurs in the second column. The
minimum cij in this column is c23 (i.e., 9). So x23 = 30 and the
The following table shows the computation of penalty for various
rows and columns
Origin 1 4 Supply Penalty
10 30 10
2 24 7 4010
40 17
50
3 32 15 50 17
Demand 60
60
50 30
Penalty 8 8
Vogel Approximation Method Ex 1 Final table 5
Destination
Origin 1 2 3 4 Supply Penalty
40 80
1 20 22 17 4 120 13 13 - -
10 30 30
2 24 37 9 7 70 2 2 2 17
50
3 32 37 20 15 50 5 5 5 17
Demand 60 40 30 110 240
4 15 8 3
4 - 8 3
8 - 11 8
Penalty
8 - - 8
Example 2 Vogels Approximation method
Destination
Origin 1 2 3 Supply
1 2 7 4 5
2 3 3 1 8
3 5 4 7 7
4 1 6 2 14
Demand 7 9 18 34
Example 2 Vogels Approximation method Table 1
Destination
Origin 1 2 3 Supply
Penalty
1 2 7 4 5 2
2 3 3 1 8 2
3 5 4 7 7 1
4 1 6 2 14 1
Demand 7 9 18 34
Penalty 1 1 1
Example 2 Vogels Approximation method Table 2
Destination
Origin 1 2 3 Supply Penalty
5
1 2 7 4 5 2
2 3 3 1 8 2
3 5 4 7 7 1
4 1 6 2 14 1
2
Demand 7 9 18 34
Penalty 1 1 1
Example 2 Vogels Approximation method Table 3
Destination
Origin 1 2 3 Supply Penalty
2 3 3 1 8 2
3 5 4 7 7 1
2 12
4 1 6 2 14 1
Demand 2 9 18 34
Penalty 2 1 1
Example 2 Vogels Approximation method Table 4
Destination
Origin 2 3 Supply Penalty
2 3 1 8 2
3 4 7 7 3
12
4 6 2 12 4
6
Demand 9 18 34
Penalty 1 1
Example 2 Vogels Approximation method Table 5
Destination
Origin 2 3 Supply Penalty
2 2
2 3 1
6
8
8 2
7
3 4 7 7 3
Demand 9 6 34
Penalty 1 6
Example 2 Vogels Approximation method
Final Table 6
Destination
Origin 1 2 3 Supply Penalty
5
1 2 7 4 5 2 - - - - -
2 6
2 3 3 1 8 2 2 2 2 3 3
7
3 5 4 7 7 1 1 3 3 4 -
2 12
4 1 6 2 14 1 1 4 - - -
Demand 7 9 18 34
1 1 1
2 1 1
- 1 1
Penalty
- 1 6
- 1 -
- 3 -
