9 Solution:

TOTAL number of supply constraints : 3

TOTAL number of demand constraints : 4
Problem Table is
D1 D2 D3 D4 Supply
S1 5 4 2 6 20
S2 8 3 5 7 30
S3 5 9 4 6 50

Demand 10 40 20 30

The smallest transportation cost is 2 in cell S1D3

The allocation to this cell is min(20,20) = 20.

Table-1
D1 D2 D3 D4 Supply
S1 5 4 2(20) 6 0
S2 8 3 5 7 30
S3 5 9 4 6 50

Demand 10 40 0 30

The smallest transportation cost is 3 in cell S2D2

The allocation to this cell is min(30,40) = 30.

This exhausts the capacity of S2 and leaves 40 - 30=10 units with D2

Table-2
D1 D2 D3 D4 Supply
S1 5 4 2(20) 6 0
S2 8 3(30) 5 7 0
S3 5 9 4 6 50

Demand 10 10 0 30

The smallest transportation cost is 5 in cell S3D1

The allocation to this cell is min(50,10) = 10.

This satisfies the entire demand of D1 and leaves 50 - 10=40 units with S3
Table-3
D1 D2 D3 D4 Supply
S1 5 4 2(20) 6 0
S2 8 3(30) 5 7 0
S3 5(10) 9 4 6 40

Demand 0 10 0 30

The smallest transportation cost is 6 in cell S3D4

The allocation to this cell is min(40,30) = 30.

This satisfies the entire demand of D4 and leaves 40 - 30=10 units with S3

Table-4
D1 D2 D3 D4 Supply
S1 5 4 2(20) 6 0
S2 8 3(30) 5 7 0
S3 5(10) 9 4 6(30) 10

Demand 0 10 0 0

The smallest transportation cost is 9 in cell S3D2

The allocation to this cell is min(10,10) = 10.

Table-5
D1 D2 D3 D4 Supply
S1 5 4 2(20) 6 0
S2 8 3(30) 5 7 0
S3 5(10) 9(10) 4 6(30) 0

Demand 0 0 0 0

Initial feasible solution is

D1 D2 D3 D4 Supply
S1 5 4 2 (20) 6 20
S2 8 3 (30) 5 7 30
S3 5 (10) 9 (10) 4 6 (30) 50

Demand 10 40 20 30

The minimum total transportation cost =2×20+3×30+5×10+9×10+6×30=450

Here, the number of allocated cells = 5, which is one less than to m + n - 1 = 3 + 4 - 1 = 6

∴ This solution is degenerate

To resolve degeneracy, we make use of an artifical quantity(d).

The quantity d is assigned to that unoccupied cell, which has the minimum transportation cost.

The quantity d is assigned to S1D2, which has the minimum transportation cost = 4.

D1 D2 D3 D4 Supply
S1 5 4 (d) 2 (20) 6 20
S2 8 3 (30) 5 7 30
S3 5 (10) 9 (10) 4 6 (30) 50

Demand 10 40 20 30

Optimality test using modi method...

Allocation Table is
D1 D2 D3 D4 Supply
S1 5 4 (d) 2 (20) 6 20
S2 8 3 (30) 5 7 30
S3 5 (10) 9 (10) 4 6 (30) 50

Demand 10 40 20 30

Iteration-1 of optimality test

1. Find ui and vj for all occupied cells(i,j), where cij=ui+vj

1. Substituting, u3=0, we get

2.c31=u3+v1⇒v1=c31-u3⇒v1=5-0⇒v1=5

3.c32=u3+v2⇒v2=c32-u3⇒v2=9-0⇒v2=9
4.c12=u1+v2⇒u1=c12-v2⇒u1=4-9⇒u1=-5

5.c13=u1+v3⇒v3=c13-u1⇒v3=2+5⇒v3=7

6.c22=u2+v2⇒u2=c22-v2⇒u2=3-9⇒u2=-6

7.c34=u3+v4⇒v4=c34-u3⇒v4=6-0⇒v4=6

D1 D2 D3 D4 Supply ui
S1 5 4 (d) 2 (20) 6 20 u1=-5
S2 8 3 (30) 5 7 30 u2=-6
S3 5 (10) 9 (10) 4 6 (30) 50 u3=0

Demand 10 40 20 30
vj v1=5 v2=9 v3=7 v4=6

( )
2. Find dij for all unoccupied cells(i,j), where dij=cij- ui+vj

( )
1.d11=c11- u1+v1 =5-(-5+5)=5

( )
2.d14=c14- u1+v4 =6-(-5+6)=5

( )
3.d21=c21- u2+v1 =8-(-6+5)=9

( )
4.d23=c23- u2+v3 =5-(-6+7)=4

( )
5.d24=c24- u2+v4 =7-(-6+6)=7

( )
6.d33=c33- u3+v3 =4-(0+7)=-3

D1 D2 D3 D4 Supply ui
S1 5 [5] 4 (d) 2 (20) 6 [5] 20 u1=-5
S2 8 [9] 3 (30) 5 [4] 7 [7] 30 u2=-6
S3 5 (10) 9 (10) 4 [-3] 6 (30) 50 u3=0

Demand 10 40 20 30
vj v1=5 v2=9 v3=7 v4=6

3. Now choose the minimum negative value from all dij (opportunity cost) = d33 = [-3]

and draw a closed path from S3D3.

Closed path is S3D3→S3D2→S1D2→S1D3

Closed path and plus/minus sign allocation...

D1 D2 D3 D4 Supply ui
S1 5 [5] 4 (d) (+) 2 (20) (-) 6 [5] 20 u1=-5
S2 8 [9] 3 (30) 5 [4] 7 [7] 30 u2=-6
S3 5 (10) 9 (10) (-) 4 [-3] (+) 6 (30) 50 u3=0

Demand 10 40 20 30
vj v1=5 v2=9 v3=7 v4=6

4. Minimum allocated value among all negative position (-) on closed path = 10
Substract 10 from all (-) and Add it to all (+)
D1 D2 D3 D4 Supply
S1 5 4 (10) 2 (10) 6 20
S2 8 3 (30) 5 7 30
S3 5 (10) 9 4 (10) 6 (30) 50

Demand 10 40 20 30

5. Repeat the step 1 to 4, until an optimal solution is obtained.

Iteration-2 of optimality test

1. Find ui and vj for all occupied cells(i,j), where cij=ui+vj

1. Substituting, u3=0, we get

2.c31=u3+v1⇒v1=c31-u3⇒v1=5-0⇒v1=5

3.c33=u3+v3⇒v3=c33-u3⇒v3=4-0⇒v3=4

4.c13=u1+v3⇒u1=c13-v3⇒u1=2-4⇒u1=-2
5.c12=u1+v2⇒v2=c12-u1⇒v2=4+2⇒v2=6

6.c22=u2+v2⇒u2=c22-v2⇒u2=3-6⇒u2=-3

7.c34=u3+v4⇒v4=c34-u3⇒v4=6-0⇒v4=6

D1 D2 D3 D4 Supply ui
S1 5 4 (10) 2 (10) 6 20 u1=-2
S2 8 3 (30) 5 7 30 u2=-3
S3 5 (10) 9 4 (10) 6 (30) 50 u3=0

Demand 10 40 20 30
vj v1=5 v2=6 v3=4 v4=6

( )
2. Find dij for all unoccupied cells(i,j), where dij=cij- ui+vj

( )
1.d11=c11- u1+v1 =5-(-2+5)=2

( )
2.d14=c14- u1+v4 =6-(-2+6)=2

( )
3.d21=c21- u2+v1 =8-(-3+5)=6

( )
4.d23=c23- u2+v3 =5-(-3+4)=4

( )
5.d24=c24- u2+v4 =7-(-3+6)=4

( )
6.d32=c32- u3+v2 =9-(0+6)=3

D1 D2 D3 D4 Supply ui
S1 5 [2] 4 (10) 2 (10) 6 [2] 20 u1=-2
S2 8 [6] 3 (30) 5 [4] 7 [4] 30 u2=-3
S3 5 (10) 9 [3] 4 (10) 6 (30) 50 u3=0

Demand 10 40 20 30
vj v1=5 v2=6 v3=4 v4=6
Since all dij≥0.

So final optimal solution is arrived.

D1 D2 D3 D4 Supply
S1 5 4 (10) 2 (10) 6 20
S2 8 3 (30) 5 7 30
S3 5 (10) 9 4 (10) 6 (30) 50

Demand 10 40 20 30

The minimum total transportation cost =4×10+2×10+3×30+5×10+4×10+6×30=420

11 Solution:
TOTAL number of supply constraints : 3
TOTAL number of demand constraints : 4
Problem Table is

D1 D2 D3 D4 Supply
S1 19 30 50 10 7
S2 70 30 40 60 9
S3 40 8 70 20 18

Demand 5 8 7 14

The rim values for S1=7 and D1=5 are compared.

The smaller of the two i.e. min(7,5) = 5 is assigned to S1 D1

This meets the complete demand of D1 and leaves 7 - 5=2 units with S1

Table-1
D1 D2 D3 D4 Supply
S1 19(5) 30 50 10 2
S2 70 30 40 60 9
S3 40 8 70 20 18
Demand 0 8 7 14

Move horizontally,

The rim values for S1=2 and D2=8 are compared.

The smaller of the two i.e. min(2,8) = 2 is assigned to S1 D2

This exhausts the capacity of S1 and leaves 8 - 2=6 units with D2

Table-2
D1 D2 D3 D4 Supply
S1 19(5) 30(2) 50 10 0
S2 70 30 40 60 9
S3 40 8 70 20 18

Demand 0 6 7 14

Move vertically,

The rim values for S2=9 and D2=6 are compared.

The smaller of the two i.e. min(9,6) = 6 is assigned to S2 D2

This meets the complete demand of D2 and leaves 9 - 6=3 units with S2

Table-3
D1 D2 D3 D4 Supply
S1 19(5) 30(2) 50 10 0
S2 70 30(6) 40 60 3
S3 40 8 70 20 18

Demand 0 0 7 14

Move horizontally,

The rim values for S2=3 and D3=7 are compared.

The smaller of the two i.e. min(3,7) = 3 is assigned to S2 D3

This exhausts the capacity of S2 and leaves 7 - 3=4 units with D3

Table-4
D1 D2 D3 D4 Supply
S1 19(5) 30(2) 50 10 0
S2 70 30(6) 40(3) 60 0
S3 40 8 70 20 18

Demand 0 0 4 14

Move vertically,

The rim values for S3=18 and D3=4 are compared.

The smaller of the two i.e. min(18,4) = 4 is assigned to S3 D3

This meets the complete demand of D3 and leaves 18 - 4=14 units with S3

Table-5
D1 D2 D3 D4 Supply
S1 19(5) 30(2) 50 10 0
S2 70 30(6) 40(3) 60 0
S3 40 8 70(4) 20 14

Demand 0 0 0 14

Move horizontally,

The rim values for S3=14 and D4=14 are compared.

The smaller of the two i.e. min(14,14) = 14 is assigned to S3 D4

Table-6
D1 D2 D3 D4 Supply
S1 19(5) 30(2) 50 10 0
S2 70 30(6) 40(3) 60 0
S3 40 8 70(4) 20(14) 0

Demand 0 0 0 0
Initial feasible solution is
D1 D2 D3 D4 Supply
S1 19 (5) 30 (2) 50 10 7
S2 70 30 (6) 40 (3) 60 9
S3 40 8 70 (4) 20 (14) 18

Demand 5 8 7 14

The minimum total transportation cost =19×5+30×2+30×6+40×3+70×4+20×14=1015

Here, the number of allocated cells = 6 is equal to m + n - 1 = 3 + 4 - 1 = 6

∴ This solution is non-degenerate

Optimality test using modi method...

Allocation Table is
D1 D2 D3 D4 Supply
S1 19 (5) 30 (2) 50 10 7
S2 70 30 (6) 40 (3) 60 9
S3 40 8 70 (4) 20 (14) 18

Demand 5 8 7 14

Iteration-1 of optimality test

1. Find ui and vj for all occupied cells(i,j), where cij=ui+vj

1. Substituting, u1=0, we get

2.c11=u1+v1⇒v1=c11-u1⇒v1=19-0⇒v1=19

3.c12=u1+v2⇒v2=c12-u1⇒v2=30-0⇒v2=30

4.c22=u2+v2⇒u2=c22-v2⇒u2=30-30⇒u2=0

5.c23=u2+v3⇒v3=c23-u2⇒v3=40-0⇒v3=40

6.c33=u3+v3⇒u3=c33-v3⇒u3=70-40⇒u3=30
7.c34=u3+v4⇒v4=c34-u3⇒v4=20-30⇒v4=-10

D1 D2 D3 D4 Supply ui
S1 19 (5) 30 (2) 50 10 7 u1=0
S2 70 30 (6) 40 (3) 60 9 u2=0
S3 40 8 70 (4) 20 (14) 18 u3=30

Demand 5 8 7 14
vj v1=19 v2=30 v3=40 v4=-10

2. Find dij for all unoccupied cells(i,j), where dij=cij- ui+vj ( )

( )
1.d13=c13- u1+v3 =50-(0+40)=10

( )
2.d14=c14- u1+v4 =10-(0-10)=20

( )
3.d21=c21- u2+v1 =70-(0+19)=51

( )
4.d24=c24- u2+v4 =60-(0-10)=70

( )
5.d31=c31- u3+v1 =40-(30+19)=-9

( )
6.d32=c32- u3+v2 =8-(30+30)=-52

D1 D2 D3 D4 Supply ui
S1 19 (5) 30 (2) 50 [10] 10 [20] 7 u1=0
S2 70 [51] 30 (6) 40 (3) 60 [70] 9 u2=0
S3 40 [-9] 8 [-52] 70 (4) 20 (14) 18 u3=30

Demand 5 8 7 14
vj v1=19 v2=30 v3=40 v4=-10

3. Now choose the minimum negative value from all dij (opportunity cost) = d32 = [-52]
and draw a closed path from S3D2.

Closed path is S3D2→S3D3→S2D3→S2D2

Closed path and plus/minus sign allocation...

D1 D2 D3 D4 Supply ui
S1 19 (5) 30 (2) 50 [10] 10 [20] 7 u1=0
S2 70 [51] 30 (6) (-) 40 (3) (+) 60 [70] 9 u2=0
S3 40 [-9] 8 [-52] (+) 70 (4) (-) 20 (14) 18 u3=30

Demand 5 8 7 14
vj v1=19 v2=30 v3=40 v4=-10

4. Minimum allocated value among all negative position (-) on closed path = 4
Substract 4 from all (-) and Add it to all (+)
D1 D2 D3 D4 Supply
S1 19 (5) 30 (2) 50 10 7
S2 70 30 (2) 40 (7) 60 9
S3 40 8 (4) 70 20 (14) 18

Demand 5 8 7 14

5. Repeat the step 1 to 4, until an optimal solution is obtained.

Iteration-2 of optimality test

1. Find ui and vj for all occupied cells(i,j), where cij=ui+vj

1. Substituting, v2=0, we get

2.c12=u1+v2⇒u1=c12-v2⇒u1=30-0⇒u1=30

3.c11=u1+v1⇒v1=c11-u1⇒v1=19-30⇒v1=-11

4.c22=u2+v2⇒u2=c22-v2⇒u2=30-0⇒u2=30

5.c23=u2+v3⇒v3=c23-u2⇒v3=40-30⇒v3=10

6.c32=u3+v2⇒u3=c32-v2⇒u3=8-0⇒u3=8

7.c34=u3+v4⇒v4=c34-u3⇒v4=20-8⇒v4=12
 D1 D2 D3 D4 Supply ui
S1 19 (5) 30 (2) 50 10 7 u1=30
S2 70 30 (2) 40 (7) 60 9 u2=30
S3 40 8 (4) 70 20 (14) 18 u3=8

Demand 5 8 7 14
vj v1=-11 v2=0 v3=10 v4=12

( )
2. Find dij for all unoccupied cells(i,j), where dij=cij- ui+vj

( )
1.d13=c13- u1+v3 =50-(30+10)=10

( )
2.d14=c14- u1+v4 =10-(30+12)=-32

( )
3.d21=c21- u2+v1 =70-(30-11)=51

( )
4.d24=c24- u2+v4 =60-(30+12)=18

( )
5.d31=c31- u3+v1 =40-(8-11)=43

( )
6.d33=c33- u3+v3 =70-(8+10)=52

D1 D2 D3 D4 Supply ui
S1 19 (5) 30 (2) 50 [10] 10 [-32] 7 u1=30
S2 70 [51] 30 (2) 40 (7) 60 [18] 9 u2=30
S3 40 [43] 8 (4) 70 [52] 20 (14) 18 u3=8

Demand 5 8 7 14
vj v1=-11 v2=0 v3=10 v4=12

3. Now choose the minimum negative value from all dij (opportunity cost) = d14 = [-32]

and draw a closed path from S1D4.

Closed path is S1D4→S1D2→S3D2→S3D4

Closed path and plus/minus sign allocation...

D1 D2 D3 D4 Supply ui
S1 19 (5) 30 (2) (-) 50 [10] 10 [-32] (+) 7 u1=30
S2 70 [51] 30 (2) 40 (7) 60 [18] 9 u2=30
S3 40 [43] 8 (4) (+) 70 [52] 20 (14) (-) 18 u3=8

Demand 5 8 7 14
vj v1=-11 v2=0 v3=10 v4=12

4. Minimum allocated value among all negative position (-) on closed path = 2
Substract 2 from all (-) and Add it to all (+)
D1 D2 D3 D4 Supply
S1 19 (5) 30 50 10 (2) 7
S2 70 30 (2) 40 (7) 60 9
S3 40 8 (6) 70 20 (12) 18

Demand 5 8 7 14

5. Repeat the step 1 to 4, until an optimal solution is obtained.

Iteration-3 of optimality test

1. Find ui and vj for all occupied cells(i,j), where cij=ui+vj

1. Substituting, u1=0, we get

2.c11=u1+v1⇒v1=c11-u1⇒v1=19-0⇒v1=19

3.c14=u1+v4⇒v4=c14-u1⇒v4=10-0⇒v4=10

4.c34=u3+v4⇒u3=c34-v4⇒u3=20-10⇒u3=10

5.c32=u3+v2⇒v2=c32-u3⇒v2=8-10⇒v2=-2

6.c22=u2+v2⇒u2=c22-v2⇒u2=30+2⇒u2=32

7.c23=u2+v3⇒v3=c23-u2⇒v3=40-32⇒v3=8

D1 D2 D3 D4 Supply ui
S1 19 (5) 30 50 10 (2) 7 u1=0
S2 70 30 (2) 40 (7) 60 9 u2=32
S3 40 8 (6) 70 20 (12) 18 u3=10

Demand 5 8 7 14
vj v1=19 v2=-2 v3=8 v4=10

2. Find dij for all unoccupied cells(i,j), where dij=cij- ui+vj ( )

( )
1.d12=c12- u1+v2 =30-(0-2)=32

( )
2.d13=c13- u1+v3 =50-(0+8)=42

( )
3.d21=c21- u2+v1 =70-(32+19)=19

( )
4.d24=c24- u2+v4 =60-(32+10)=18

( )
5.d31=c31- u3+v1 =40-(10+19)=11

( )
6.d33=c33- u3+v3 =70-(10+8)=52

D1 D2 D3 D4 Supply ui
S1 19 (5) 30 [32] 50 [42] 10 (2) 7 u1=0
S2 70 [19] 30 (2) 40 (7) 60 [18] 9 u2=32
S3 40 [11] 8 (6) 70 [52] 20 (12) 18 u3=10

Demand 5 8 7 14
vj v1=19 v2=-2 v3=8 v4=10

Since all dij≥0.

So final optimal solution is arrived.

D1 D2 D3 D4 Supply
S1 19 (5) 30 50 10 (2) 7
S2 70 30 (2) 40 (7) 60 9
S3 40 8 (6) 70 20 (12) 18

Demand 5 8 7 14

The minimum total transportation cost =19×5+10×2+30×2+40×7+8×6+20×12=743

12 Solution:
TOTAL number of supply constraints : 4
TOTAL number of demand constraints : 6
Problem Table is

D1 D2 D3 D4 D5 D6 Supply
S1 9 12 9 6 9 10 5
S2 7 3 7 7 5 5 6
S3 6 5 9 11 3 11 2
S4 6 8 11 2 2 10 9

Demand 4 4 6 2 4 2

Table-1
D1 D2 D3 D4 D5 D6 Supply Row Penalty
S1 9 12 9 6 9 10 5 3=9-6
S2 7 3 7 7 5 5 6 2=5-3
S3 6 5 9 11 3 11 2 2=5-3
S4 6 8 11 2 2 10 9 0=2-2

Demand 4 4 6 2 4 2
Column
0=6-6 2=5-3 2=9-7 4=6-2 1=3-2 5=10-5
Penalty

The maximum penalty, 5, occurs in column D6.

The minimum cij in this column is c26=5.

The maximum allocation in this cell is min(6,2) = 2.
It satisfy demand of D6 and adjust the supply of S2 from 6 to 4 (6 - 2=4).

Table-2
D1 D2 D3 D4 D5 D6 Supply Row Penalty
S1 9 12 9 6 9 10 5 3=9-6
S2 7 3 7 7 5 5(2) 4 2=5-3
S3 6 5 9 11 3 11 2 2=5-3
S4 6 8 11 2 2 10 9 0=2-2

Demand 4 4 6 2 4 0
Column
0=6-6 2=5-3 2=9-7 4=6-2 1=3-2 --
Penalty

The maximum penalty, 4, occurs in column D4.

The minimum cij in this column is c44=2.

The maximum allocation in this cell is min(9,2) = 2.

It satisfy demand of D4 and adjust the supply of S4 from 9 to 7 (9 - 2=7).

Table-3
D1 D2 D3 D4 D5 D6 Supply Row Penalty
S1 9 12 9 6 9 10 5 0=9-9
S2 7 3 7 7 5 5(2) 4 2=5-3
S3 6 5 9 11 3 11 2 2=5-3
S4 6 8 11 2(2) 2 10 7 4=6-2

Demand 4 4 6 0 4 0
Column
0=6-6 2=5-3 2=9-7 -- 1=3-2 --
Penalty

The maximum penalty, 4, occurs in row S4.

The minimum cij in this row is c45=2.

The maximum allocation in this cell is min(7,4) = 4.

It satisfy demand of D5 and adjust the supply of S4 from 7 to 3 (7 - 4=3).
Table-4
D1 D2 D3 D4 D5 D6 Supply Row Penalty
S1 9 12 9 6 9 10 5 0=9-9
S2 7 3 7 7 5 5(2) 4 4=7-3
S3 6 5 9 11 3 11 2 1=6-5
S4 6 8 11 2(2) 2(4) 10 3 2=8-6

Demand 4 4 6 0 0 0
Column
0=6-6 2=5-3 2=9-7 -- -- --
Penalty

The maximum penalty, 4, occurs in row S2.

The minimum cij in this row is c22=3.

The maximum allocation in this cell is min(4,4) = 4.

It satisfy supply of S2 and demand of D2.

Table-5
D1 D2 D3 D4 D5 D6 Supply Row Penalty
S1 9 12 9 6 9 10 5 0=9-9
S2 7 3(4) 7 7 5 5(2) 0 --
S3 6 5 9 11 3 11 2 3=9-6
S4 6 8 11 2(2) 2(4) 10 3 5=11-6

Demand 4 0 6 0 0 0
Column
0=6-6 -- 0=9-9 -- -- --
Penalty

The maximum penalty, 5, occurs in row S4.

The minimum cij in this row is c41=6.

The maximum allocation in this cell is min(3,4) = 3.

It satisfy supply of S4 and adjust the demand of D1 from 4 to 1 (4 - 3=1).

Table-6
D1 D2 D3 D4 D5 D6 Supply Row Penalty
 S1 9 12 9 6 9 10 5 0=9-9
S2 7 3(4) 7 7 5 5(2) 0 --
S3 6 5 9 11 3 11 2 3=9-6
S4 6(3) 8 11 2(2) 2(4) 10 0 --

Demand 1 0 6 0 0 0
Column
3=9-6 -- 0=9-9 -- -- --
Penalty

The maximum penalty, 3, occurs in row S3.

The minimum cij in this row is c31=6.

The maximum allocation in this cell is min(2,1) = 1.

It satisfy demand of D1 and adjust the supply of S3 from 2 to 1 (2 - 1=1).

Table-7
D1 D2 D3 D4 D5 D6 Supply Row Penalty
S1 9 12 9 6 9 10 5 9
S2 7 3(4) 7 7 5 5(2) 0 --
S3 6(1) 5 9 11 3 11 1 9
S4 6(3) 8 11 2(2) 2(4) 10 0 --

Demand 0 0 6 0 0 0
Column
-- -- 0=9-9 -- -- --
Penalty

The maximum penalty, 9, occurs in row S1.

The minimum cij in this row is c13=9.

The maximum allocation in this cell is min(5,6) = 5.

It satisfy supply of S1 and adjust the demand of D3 from 6 to 1 (6 - 5=1).

Table-8
D1 D2 D3 D4 D5 D6 Supply Row Penalty
S1 9 12 9(5) 6 9 10 0 --
S2 7 3(4) 7 7 5 5(2) 0 --
 S3 6(1) 5 9 11 3 11 1 9
S4 6(3) 8 11 2(2) 2(4) 10 0 --

Demand 0 0 1 0 0 0
Column
-- -- 9 -- -- --
Penalty

The maximum penalty, 9, occurs in row S3.

The minimum cij in this row is c33=9.

The maximum allocation in this cell is min(1,1) = 1.

It satisfy supply of S3 and demand of D3.

Initial feasible solution is

D1 D2 D3 D4 D5 D6 Supply Row Penalty
S1 9 12 9(5) 6 9 10 5 3 | 3 | 0 | 0 | 0 | 0 | 9 | -- |
S2 7 3(4) 7 7 5 5(2) 6 2 | 2 | 2 | 4 | -- | -- | -- | -- |
S3 6(1) 5 9(1) 11 3 11 2 2| 2| 2| 1| 3| 3| 9| 9|
S4 6(3) 8 11 2(2) 2(4) 10 9 0 | 0 | 4 | 2 | 5 | -- | -- | -- |

Demand 4 4 6 2 4 2
0 2 2 4 1 5
0 2 2 4 1 --
0 2 2 -- 1 --
Column 0 2 2 -- -- --
Penalty 0 -- 0 -- -- --
3 -- 0 -- -- --
-- -- 0 -- -- --
-- -- 9 -- -- --

The minimum total transportation cost =9×5+3×4+5×2+6×1+9×1+6×3+2×2+2×4=112

Here, the number of allocated cells = 8, which is one less than to m + n - 1 = 4 + 6 - 1 = 9

∴ This solution is degenerate

To resolve degeneracy, we make use of an artifical quantity(d).

The quantity d is assigned to that unoccupied cell, which has the minimum transportation cost.

The quantity d is assigned to S2D5, which has the minimum transportation cost = 5.
 D1 D2 D3 D4 D5 D6 Supply
S1 9 12 9 (5) 6 9 10 5
S2 7 3 (4) 7 7 5 (d) 5 (2) 6
S3 6 (1) 5 9 (1) 11 3 11 2
S4 6 (3) 8 11 2 (2) 2 (4) 10 9

Demand 4 4 6 2 4 2

Optimality test using modi method...

Allocation Table is
D1 D2 D3 D4 D5 D6 Supply
S1 9 12 9 (5) 6 9 10 5
S2 7 3 (4) 7 7 5 (d) 5 (2) 6
S3 6 (1) 5 9 (1) 11 3 11 2
S4 6 (3) 8 11 2 (2) 2 (4) 10 9

Demand 4 4 6 2 4 2

Iteration-1 of optimality test

1. Find ui and vj for all occupied cells(i,j), where cij=ui+vj

1. Substituting, u2=0, we get

2.c22=u2+v2⇒v2=c22-u2⇒v2=3-0⇒v2=3

3.c25=u2+v5⇒v5=c25-u2⇒v5=5-0⇒v5=5

4.c45=u4+v5⇒u4=c45-v5⇒u4=2-5⇒u4=-3

5.c41=u4+v1⇒v1=c41-u4⇒v1=6+3⇒v1=9

6.c31=u3+v1⇒u3=c31-v1⇒u3=6-9⇒u3=-3

7.c33=u3+v3⇒v3=c33-u3⇒v3=9+3⇒v3=12

8.c13=u1+v3⇒u1=c13-v3⇒u1=9-12⇒u1=-3

9.c44=u4+v4⇒v4=c44-u4⇒v4=2+3⇒v4=5
10.c26=u2+v6⇒v6=c26-u2⇒v6=5-0⇒v6=5

D1 D2 D3 D4 D5 D6 Supply ui
S1 9 12 9 (5) 6 9 10 5 u1=-3
S2 7 3 (4) 7 7 5 (d) 5 (2) 6 u2=0
S3 6 (1) 5 9 (1) 11 3 11 2 u3=-3
S4 6 (3) 8 11 2 (2) 2 (4) 10 9 u4=-3

Demand 4 4 6 2 4 2
vj v1=9 v2=3 v3=12 v4=5 v5=5 v6=5

( )
2. Find dij for all unoccupied cells(i,j), where dij=cij- ui+vj

( )
1.d11=c11- u1+v1 =9-(-3+9)=3

( )
2.d12=c12- u1+v2 =12-(-3+3)=12

( )
3.d14=c14- u1+v4 =6-(-3+5)=4

( )
4.d15=c15- u1+v5 =9-(-3+5)=7

( )
5.d16=c16- u1+v6 =10-(-3+5)=8

( )
6.d21=c21- u2+v1 =7-(0+9)=-2

( )
7.d23=c23- u2+v3 =7-(0+12)=-5

( )
8.d24=c24- u2+v4 =7-(0+5)=2

( )
9.d32=c32- u3+v2 =5-(-3+3)=5

( )
10.d34=c34- u3+v4 =11-(-3+5)=9
 ( )
11.d35=c35- u3+v5 =3-(-3+5)=1

( )
12.d36=c36- u3+v6 =11-(-3+5)=9

( )
13.d42=c42- u4+v2 =8-(-3+3)=8

( )
14.d43=c43- u4+v3 =11-(-3+12)=2

( )
15.d46=c46- u4+v6 =10-(-3+5)=8

D1 D2 D3 D4 D5 D6 Supply ui
S1 9 [3] 12 [12] 9 (5) 6 [4] 9 [7] 10 [8] 5 u1=-3
S2 7 [-2] 3 (4) 7 [-5] 7 [2] 5 (d) 5 (2) 6 u2=0
S3 6 (1) 5 [5] 9 (1) 11 [9] 3 [1] 11 [9] 2 u3=-3
S4 6 (3) 8 [8] 11 [2] 2 (2) 2 (4) 10 [8] 9 u4=-3

Demand 4 4 6 2 4 2
vj v1=9 v2=3 v3=12 v4=5 v5=5 v6=5

3. Now choose the minimum negative value from all dij (opportunity cost) = d23 = [-5]

and draw a closed path from S2D3.

Closed path is S2D3→S2D5→S4D5→S4D1→S3D1→S3D3

Closed path and plus/minus sign allocation...

D1 D2 D3 D4 D5 D6 Supply ui
S1 9 [3] 12 [12] 9 (5) 6 [4] 9 [7] 10 [8] 5 u1=-3
S2 7 [-2] 3 (4) 7 [-5] (+) 7 [2] 5 (d) (-) 5 (2) 6 u2=0
S3 6 (1) (+) 5 [5] 9 (1) (-) 11 [9] 3 [1] 11 [9] 2 u3=-3
S4 6 (3) (-) 8 [8] 11 [2] 2 (2) 2 (4) (+) 10 [8] 9 u4=-3

Demand 4 4 6 2 4 2
vj v1=9 v2=3 v3=12 v4=5 v5=5 v6=5
dummy cell is selected, so stop the procedure for current selected dummy cell.

Try the optimal solution with next dummy cell count - 2

The quantity d is assigned to S3D2, which has the minimum transportation cost = 5.

D1 D2 D3 D4 D5 D6 Supply
S1 9 12 9 (5) 6 9 10 5
S2 7 3 (4) 7 7 5 5 (2) 6
S3 6 (1) 5 (d) 9 (1) 11 3 11 2
S4 6 (3) 8 11 2 (2) 2 (4) 10 9

Demand 4 4 6 2 4 2

Optimality test using modi method...

Allocation Table is
D1 D2 D3 D4 D5 D6 Supply
S1 9 12 9 (5) 6 9 10 5
S2 7 3 (4) 7 7 5 5 (2) 6
S3 6 (1) 5 (d) 9 (1) 11 3 11 2
S4 6 (3) 8 11 2 (2) 2 (4) 10 9

Demand 4 4 6 2 4 2

Iteration-1 of optimality test

1. Find ui and vj for all occupied cells(i,j), where cij=ui+vj

1. Substituting, u3=0, we get

2.c31=u3+v1⇒v1=c31-u3⇒v1=6-0⇒v1=6

3.c41=u4+v1⇒u4=c41-v1⇒u4=6-6⇒u4=0

4.c44=u4+v4⇒v4=c44-u4⇒v4=2-0⇒v4=2

5.c45=u4+v5⇒v5=c45-u4⇒v5=2-0⇒v5=2
6.c32=u3+v2⇒v2=c32-u3⇒v2=5-0⇒v2=5

7.c22=u2+v2⇒u2=c22-v2⇒u2=3-5⇒u2=-2

8.c26=u2+v6⇒v6=c26-u2⇒v6=5+2⇒v6=7

9.c33=u3+v3⇒v3=c33-u3⇒v3=9-0⇒v3=9

10.c13=u1+v3⇒u1=c13-v3⇒u1=9-9⇒u1=0

D1 D2 D3 D4 D5 D6 Supply ui
S1 9 12 9 (5) 6 9 10 5 u1=0
S2 7 3 (4) 7 7 5 5 (2) 6 u2=-2
S3 6 (1) 5 (d) 9 (1) 11 3 11 2 u3=0
S4 6 (3) 8 11 2 (2) 2 (4) 10 9 u4=0

Demand 4 4 6 2 4 2
vj v1=6 v2=5 v3=9 v4=2 v5=2 v6=7

( )
2. Find dij for all unoccupied cells(i,j), where dij=cij- ui+vj

( )
1.d11=c11- u1+v1 =9-(0+6)=3

( )
2.d12=c12- u1+v2 =12-(0+5)=7

( )
3.d14=c14- u1+v4 =6-(0+2)=4

( )
4.d15=c15- u1+v5 =9-(0+2)=7

( )
5.d16=c16- u1+v6 =10-(0+7)=3

( )
6.d21=c21- u2+v1 =7-(-2+6)=3

( )
7.d23=c23- u2+v3 =7-(-2+9)=0

( )
8.d24=c24- u2+v4 =7-(-2+2)=7
 ( )
9.d25=c25- u2+v5 =5-(-2+2)=5

( )
10.d34=c34- u3+v4 =11-(0+2)=9

( )
11.d35=c35- u3+v5 =3-(0+2)=1

( )
12.d36=c36- u3+v6 =11-(0+7)=4

( )
13.d42=c42- u4+v2 =8-(0+5)=3

( )
14.d43=c43- u4+v3 =11-(0+9)=2

( )
15.d46=c46- u4+v6 =10-(0+7)=3

D1 D2 D3 D4 D5 D6 Supply ui
S1 9 [3] 12 [7] 9 (5) 6 [4] 9 [7] 10 [3] 5 u1=0
S2 7 [3] 3 (4) 7 [0] 7 [7] 5 [5] 5 (2) 6 u2=-2
S3 6 (1) 5 (d) 9 (1) 11 [9] 3 [1] 11 [4] 2 u3=0
S4 6 (3) 8 [3] 11 [2] 2 (2) 2 (4) 10 [3] 9 u4=0

Demand 4 4 6 2 4 2
vj v1=6 v2=5 v3=9 v4=2 v5=2 v6=7

Since all dij≥0.

So final optimal solution is arrived.

D1 D2 D3 D4 D5 D6 Supply
S1 9 12 9 (5) 6 9 10 5
S2 7 3 (4) 7 7 5 5 (2) 6
S3 6 (1) 5 (d) 9 (1) 11 3 11 2
S4 6 (3) 8 11 2 (2) 2 (4) 10 9

Demand 4 4 6 2 4 2
The minimum total transportation cost =9×5+3×4+5×2+6×1+9×1+6×3+2×2+2×4=112

13 Solution:
TOTAL number of supply constraints : 3
TOTAL number of demand constraints : 4
Problem Table is

D1 D2 D3 D4 Supply
S1 1 2 3 4 6
S2 4 3 2 0 8
S3 0 2 2 1 10

Demand 4 6 8 6

Table-1
D1 D2 D3 D4 Supply Row Penalty
S1 1 2 3 4 6 1=2-1
S2 4 3 2 0 8 2=2-0
S3 0 2 2 1 10 1=1-0

Demand 4 6 8 6
Column
1=1-0 0=2-2 0=2-2 1=1-0
Penalty

The maximum penalty, 2, occurs in row S2.

The minimum cij in this row is c24=0.

The maximum allocation in this cell is min(8,6) = 6.

It satisfy demand of D4 and adjust the supply of S2 from 8 to 2 (8 - 6=2).

Table-2
D1 D2 D3 D4 Supply Row Penalty
S1 1 2 3 4 6 1=2-1
S2 4 3 2 0(6) 2 1=3-2
S3 0 2 2 1 10 2=2-0
Demand 4 6 8 0
Column
1=1-0 0=2-2 0=2-2 --
Penalty

The maximum penalty, 2, occurs in row S3.

The minimum cij in this row is c31=0.

The maximum allocation in this cell is min(10,4) = 4.

It satisfy demand of D1 and adjust the supply of S3 from 10 to 6 (10 - 4=6).

Table-3
D1 D2 D3 D4 Supply Row Penalty
S1 1 2 3 4 6 1=3-2
S2 4 3 2 0(6) 2 1=3-2
S3 0(4) 2 2 1 6 0=2-2

Demand 0 6 8 0
Column
-- 0=2-2 0=2-2 --
Penalty

The maximum penalty, 1, occurs in row S1.

The minimum cij in this row is c12=2.

The maximum allocation in this cell is min(6,6) = 6.

It satisfy supply of S1 and demand of D2.

Table-4
D1 D2 D3 D4 Supply Row Penalty
S1 1 2(6) 3 4 0 --
S2 4 3 2 0(6) 2 2
S3 0(4) 2 2 1 6 2

Demand 0 0 8 0
Column
-- -- 0=2-2 --
Penalty

The maximum penalty, 2, occurs in row S3.

The minimum cij in this row is c33=2.

The maximum allocation in this cell is min(6,8) = 6.

It satisfy supply of S3 and adjust the demand of D3 from 8 to 2 (8 - 6=2).

Table-5
D1 D2 D3 D4 Supply Row Penalty
S1 1 2(6) 3 4 0 --
S2 4 3 2 0(6) 2 2
S3 0(4) 2 2(6) 1 0 --

Demand 0 0 2 0
Column
-- -- 2 --
Penalty

The maximum penalty, 2, occurs in row S2.

The minimum cij in this row is c23=2.

The maximum allocation in this cell is min(2,2) = 2.

It satisfy supply of S2 and demand of D3.

Initial feasible solution is

D1 D2 D3 D4 Supply Row Penalty
S1 1 2(6) 3 4 6 1 | 1 | 1 | -- | -- |
S2 4 3 2(2) 0(6) 8 2| 1| 1| 2| 2|
S3 0(4) 2 2(6) 1 10 1 | 2 | 0 | 2 | -- |

Demand 4 6 8 6
1 0 0 1
1 0 0 --
Column
-- 0 0 --
Penalty
-- -- 0 --
-- -- 2 --

The minimum total transportation cost =2×6+2×2+0×6+0×4+2×6=28

Here, the number of allocated cells = 5, which is one less than to m + n - 1 = 3 + 4 - 1 = 6

∴ This solution is degenerate
To resolve degeneracy, we make use of an artifical quantity(d).
The quantity d is assigned to that unoccupied cell, which has the minimum transportation cost.

The quantity d is assigned to S1D1, which has the minimum transportation cost = 1.

D1 D2 D3 D4 Supply
S1 1 (d) 2 (6) 3 4 6
S2 4 3 2 (2) 0 (6) 8
S3 0 (4) 2 2 (6) 1 10

Demand 4 6 8 6

Optimality test using modi method...

Allocation Table is
D1 D2 D3 D4 Supply
S1 1 (d) 2 (6) 3 4 6
S2 4 3 2 (2) 0 (6) 8
S3 0 (4) 2 2 (6) 1 10

Demand 4 6 8 6

Iteration-1 of optimality test

1. Find ui and vj for all occupied cells(i,j), where cij=ui+vj

1. Substituting, u1=0, we get

2.c11=u1+v1⇒v1=c11-u1⇒v1=1-0⇒v1=1

3.c31=u3+v1⇒u3=c31-v1⇒u3=0-1⇒u3=-1

4.c33=u3+v3⇒v3=c33-u3⇒v3=2+1⇒v3=3

5.c23=u2+v3⇒u2=c23-v3⇒u2=2-3⇒u2=-1

6.c24=u2+v4⇒v4=c24-u2⇒v4=0+1⇒v4=1

7.c12=u1+v2⇒v2=c12-u1⇒v2=2-0⇒v2=2

D1 D2 D3 D4 Supply ui
S1 1 (d) 2 (6) 3 4 6 u1=0
S2 4 3 2 (2) 0 (6) 8 u2=-1
S3 0 (4) 2 2 (6) 1 10 u3=-1

Demand 4 6 8 6
vj v1=1 v2=2 v3=3 v4=1

( )
2. Find dij for all unoccupied cells(i,j), where dij=cij- ui+vj

( )
1.d13=c13- u1+v3 =3-(0+3)=0

( )
2.d14=c14- u1+v4 =4-(0+1)=3

( )
3.d21=c21- u2+v1 =4-(-1+1)=4

( )
4.d22=c22- u2+v2 =3-(-1+2)=2

( )
5.d32=c32- u3+v2 =2-(-1+2)=1

( )
6.d34=c34- u3+v4 =1-(-1+1)=1

D1 D2 D3 D4 Supply ui
S1 1 (d) 2 (6) 3 [0] 4 [3] 6 u1=0
S2 4 [4] 3 [2] 2 (2) 0 (6) 8 u2=-1
S3 0 (4) 2 [1] 2 (6) 1 [1] 10 u3=-1

Demand 4 6 8 6
vj v1=1 v2=2 v3=3 v4=1

Since all dij≥0.

So final optimal solution is arrived.

D1 D2 D3 D4 Supply
S1 1 (d) 2 (6) 3 4 6
S2 4 3 2 (2) 0 (6) 8
S3 0 (4) 2 2 (6) 1 10

Demand 4 6 8 6

The minimum total transportation cost =2×6+2×2+0×6+0×4+2×6=28

14 Solution:
TOTAL number of supply constraints : 3
TOTAL number of demand constraints : 4
Problem Table is

D1 D2 D3 D4 Supply
S1 11 20 7 8 50
S2 21 16 20 12 40
S3 8 12 8 9 70

Demand 30 25 35 40

Here Total Demand = 130 is less than Total Supply = 160. So We add a dummy demand constraint
with 0 unit cost and with allocation 30.
Now, The modified table is
D1 D2 D3 D4 Ddummy Supply
S1 11 20 7 8 0 50
S2 21 16 20 12 0 40
S3 8 12 8 9 0 70

Demand 30 25 35 40 30

Table-1
D1 D2 D3 D4 Ddummy Supply Row Penalty
S1 11 20 7 8 0 50 7=7-0
S2 21 16 20 12 0 40 12=12-0
S3 8 12 8 9 0 70 8=8-0
Demand 30 25 35 40 30
Column
3=11-8 4=16-12 1=8-7 1=9-8 0=0-0
Penalty

The maximum penalty, 12, occurs in row S2.

The minimum cij in this row is c25=0.

The maximum allocation in this cell is min(40,30) = 30.

It satisfy demand of Ddummy and adjust the supply of S2 from 40 to 10 (40 - 30=10).

Table-2
D1 D2 D3 D4 Ddummy Supply Row Penalty
S1 11 20 7 8 0 50 1=8-7
S2 21 16 20 12 0(30) 10 4=16-12
S3 8 12 8 9 0 70 0=8-8

Demand 30 25 35 40 0
Column
3=11-8 4=16-12 1=8-7 1=9-8 --
Penalty

The maximum penalty, 4, occurs in column D2.

The minimum cij in this column is c32=12.

The maximum allocation in this cell is min(70,25) = 25.

It satisfy demand of D2 and adjust the supply of S3 from 70 to 45 (70 - 25=45).

Table-3
D1 D2 D3 D4 Ddummy Supply Row Penalty
S1 11 20 7 8 0 50 1=8-7
S2 21 16 20 12 0(30) 10 8=20-12
S3 8 12(25) 8 9 0 45 0=8-8

Demand 30 0 35 40 0
Column
3=11-8 -- 1=8-7 1=9-8 --
Penalty

The maximum penalty, 8, occurs in row S2.

The minimum cij in this row is c24=12.

The maximum allocation in this cell is min(10,40) = 10.

It satisfy supply of S2 and adjust the demand of D4 from 40 to 30 (40 - 10=30).

Table-4
D1 D2 D3 D4 Ddummy Supply Row Penalty
S1 11 20 7 8 0 50 1=8-7
S2 21 16 20 12(10) 0(30) 0 --
S3 8 12(25) 8 9 0 45 0=8-8

Demand 30 0 35 30 0
Column
3=11-8 -- 1=8-7 1=9-8 --
Penalty

The maximum penalty, 3, occurs in column D1.

The minimum cij in this column is c31=8.

The maximum allocation in this cell is min(45,30) = 30.

It satisfy demand of D1 and adjust the supply of S3 from 45 to 15 (45 - 30=15).

Table-5
D1 D2 D3 D4 Ddummy Supply Row Penalty
S1 11 20 7 8 0 50 1=8-7
S2 21 16 20 12(10) 0(30) 0 --
S3 8(30) 12(25) 8 9 0 15 1=9-8

Demand 0 0 35 30 0
Column
-- -- 1=8-7 1=9-8 --
Penalty

The maximum penalty, 1, occurs in row S1.

The minimum cij in this row is c13=7.

The maximum allocation in this cell is min(50,35) = 35.

It satisfy demand of D3 and adjust the supply of S1 from 50 to 15 (50 - 35=15).

Table-6
 D1 D2 D3 D4 Ddummy Supply Row Penalty
S1 11 20 7(35) 8 0 15 8
S2 21 16 20 12(10) 0(30) 0 --
S3 8(30) 12(25) 8 9 0 15 9

Demand 0 0 0 30 0
Column
-- -- -- 1=9-8 --
Penalty

The maximum penalty, 9, occurs in row S3.

The minimum cij in this row is c34=9.

The maximum allocation in this cell is min(15,30) = 15.

It satisfy supply of S3 and adjust the demand of D4 from 30 to 15 (30 - 15=15).

Table-7
D1 D2 D3 D4 Ddummy Supply Row Penalty
S1 11 20 7(35) 8 0 15 8
S2 21 16 20 12(10) 0(30) 0 --
S3 8(30) 12(25) 8 9(15) 0 0 --

Demand 0 0 0 15 0
Column
-- -- -- 8 --
Penalty

The maximum penalty, 8, occurs in row S1.

The minimum cij in this row is c14=8.

The maximum allocation in this cell is min(15,15) = 15.

It satisfy supply of S1 and demand of D4.

Initial feasible solution is

D1 D2 D3 D4 Ddummy Supply Row Penalty
S1 11 20 7(35) 8(15) 0 50 7| 1| 1| 1| 1| 8| 8|
S2 21 16 20 12(10) 0(30) 40 12 | 4 | 8 | -- | -- | -- | -- |
 S3 8(30) 12(25) 8 9(15) 0 70 8 | 0 | 0 | 0 | 1 | 9 | -- |

Demand 30 25 35 40 30
3 4 1 1 0
3 4 1 1 --
3 -- 1 1 --
Column
3 -- 1 1 --
Penalty
-- -- 1 1 --
-- -- -- 1 --
-- -- -- 8 --

The minimum total transportation cost =7×35+8×15+12×10+0×30+8×30+12×25+9×15=1160

Here, the number of allocated cells = 7 is equal to m + n - 1 = 3 + 5 - 1 = 7

∴ This solution is non-degenerate

Optimality test using modi method...

Allocation Table is
D1 D2 D3 D4 Ddummy Supply
S1 11 20 7 (35) 8 (15) 0 50
S2 21 16 20 12 (10) 0 (30) 40
S3 8 (30) 12 (25) 8 9 (15) 0 70

Demand 30 25 35 40 30

Iteration-1 of optimality test

1. Find ui and vj for all occupied cells(i,j), where cij=ui+vj

1. Substituting, u3=0, we get

2.c31=u3+v1⇒v1=c31-u3⇒v1=8-0⇒v1=8

3.c32=u3+v2⇒v2=c32-u3⇒v2=12-0⇒v2=12

4.c34=u3+v4⇒v4=c34-u3⇒v4=9-0⇒v4=9

5.c14=u1+v4⇒u1=c14-v4⇒u1=8-9⇒u1=-1

6.c13=u1+v3⇒v3=c13-u1⇒v3=7+1⇒v3=8

7.c24=u2+v4⇒u2=c24-v4⇒u2=12-9⇒u2=3
8.c25=u2+v5⇒v5=c25-u2⇒v5=0-3⇒v5=-3

D1 D2 D3 D4 Ddummy Supply ui
S1 11 20 7 (35) 8 (15) 0 50 u1=-1
S2 21 16 20 12 (10) 0 (30) 40 u2=3
S3 8 (30) 12 (25) 8 9 (15) 0 70 u3=0

Demand 30 25 35 40 30
vj v1=8 v2=12 v3=8 v4=9 v5=-3

( )
2. Find dij for all unoccupied cells(i,j), where dij=cij- ui+vj

( )
1.d11=c11- u1+v1 =11-(-1+8)=4

( )
2.d12=c12- u1+v2 =20-(-1+12)=9

( )
3.d15=c15- u1+v5 =0-(-1-3)=4

( )
4.d21=c21- u2+v1 =21-(3+8)=10

( )
5.d22=c22- u2+v2 =16-(3+12)=1

( )
6.d23=c23- u2+v3 =20-(3+8)=9

( )
7.d33=c33- u3+v3 =8-(0+8)=0

( )
8.d35=c35- u3+v5 =0-(0-3)=3

D1 D2 D3 D4 Ddummy Supply ui
S1 11 [4] 20 [9] 7 (35) 8 (15) 0 [4] 50 u1=-1
S2 21 [10] 16 [1] 20 [9] 12 (10) 0 (30) 40 u2=3
S3 8 (30) 12 (25) 8 [0] 9 (15) 0 [3] 70 u3=0

Demand 30 25 35 40 30
vj v1=8 v2=12 v3=8 v4=9 v5=-3

Since all dij≥0.

So final optimal solution is arrived.

D1 D2 D3 D4 Ddummy Supply
S1 11 20 7 (35) 8 (15) 0 50
S2 21 16 20 12 (10) 0 (30) 40
S3 8 (30) 12 (25) 8 9 (15) 0 70

Demand 30 25 35 40 30

The minimum total transportation cost =7×35+8×15+12×10+0×30+8×30+12×25+9×15=1160

15 Solution:
TOTAL number of supply constraints : 3
TOTAL number of demand constraints : 4
Problem Table is

D1 D2 D3 D4 Supply
S1 40 25 22 33 100
S2 44 35 30 30 30
S3 38 38 28 30 70

Demand 40 20 60 30

Here Total Demand = 150 is less than Total Supply = 200. So We add a dummy demand constraint
with 0 unit cost and with allocation 50.
Now, The modified table is
D1 D2 D3 D4 Ddummy Supply
S1 40 25 22 33 0 100
S2 44 35 30 30 0 30
S3 38 38 28 30 0 70

Demand 40 20 60 30 50
Problem is Maximization, so convert it to minimization by subtracting all the elements from max
element (44)
D1 D2 D3 D4 Ddummy Supply
S1 4 19 22 11 44 100
S2 0 9 14 14 44 30
S3 6 6 16 14 44 70

Demand 40 20 60 30 50

Table-1
D1 D2 D3 D4 Ddummy Supply Row Penalty
S1 4 19 22 11 44 100 7=11-4
S2 0 9 14 14 44 30 9=9-0
S3 6 6 16 14 44 70 0=6-6

Demand 40 20 60 30 50
Column
4=4-0 3=9-6 2=16-14 3=14-11 0=44-44
Penalty

The maximum penalty, 9, occurs in row S2.

The minimum cij in this row is c21=0.

The maximum allocation in this cell is min(30,40) = 30.

It satisfy supply of S2 and adjust the demand of D1 from 40 to 10 (40 - 30=10).

Table-2
D1 D2 D3 D4 Ddummy Supply Row Penalty
S1 4 19 22 11 44 100 7=11-4
S2 0(30) 9 14 14 44 0 --
S3 6 6 16 14 44 70 0=6-6

Demand 10 20 60 30 50
Column
2=6-4 13=19-6 6=22-16 3=14-11 0=44-44
Penalty

The maximum penalty, 13, occurs in column D2.

The minimum cij in this column is c32=6.

The maximum allocation in this cell is min(70,20) = 20.

It satisfy demand of D2 and adjust the supply of S3 from 70 to 50 (70 - 20=50).

Table-3
D1 D2 D3 D4 Ddummy Supply Row Penalty
S1 4 19 22 11 44 100 7=11-4
S2 0(30) 9 14 14 44 0 --
S3 6 6(20) 16 14 44 50 8=14-6

Demand 10 0 60 30 50
Column
2=6-4 -- 6=22-16 3=14-11 0=44-44
Penalty

The maximum penalty, 8, occurs in row S3.

The minimum cij in this row is c31=6.

The maximum allocation in this cell is min(50,10) = 10.

It satisfy demand of D1 and adjust the supply of S3 from 50 to 40 (50 - 10=40).

Table-4
D1 D2 D3 D4 Ddummy Supply Row Penalty
S1 4 19 22 11 44 100 11=22-11
S2 0(30) 9 14 14 44 0 --
S3 6(10) 6(20) 16 14 44 40 2=16-14

Demand 0 0 60 30 50
Column
-- -- 6=22-16 3=14-11 0=44-44
Penalty

The maximum penalty, 11, occurs in row S1.

The minimum cij in this row is c14=11.

The maximum allocation in this cell is min(100,30) = 30.

It satisfy demand of D4 and adjust the supply of S1 from 100 to 70 (100 - 30=70).

Table-5
 D1 D2 D3 D4 Ddummy Supply Row Penalty
S1 4 19 22 11(30) 44 70 22=44-22
S2 0(30) 9 14 14 44 0 --
S3 6(10) 6(20) 16 14 44 40 28=44-16

Demand 0 0 60 0 50
Column
-- -- 6=22-16 -- 0=44-44
Penalty

The maximum penalty, 28, occurs in row S3.

The minimum cij in this row is c33=16.

The maximum allocation in this cell is min(40,60) = 40.

It satisfy supply of S3 and adjust the demand of D3 from 60 to 20 (60 - 40=20).

Table-6
D1 D2 D3 D4 Ddummy Supply Row Penalty
S1 4 19 22 11(30) 44 70 22=44-22
S2 0(30) 9 14 14 44 0 --
S3 6(10) 6(20) 16(40) 14 44 0 --

Demand 0 0 20 0 50
Column
-- -- 22 -- 44
Penalty

The maximum penalty, 44, occurs in column Ddummy.

The minimum cij in this column is c15=44.

The maximum allocation in this cell is min(70,50) = 50.

It satisfy demand of Ddummy and adjust the supply of S1 from 70 to 20 (70 - 50=20).

Table-7
D1 D2 D3 D4 Ddummy Supply Row Penalty
S1 4 19 22 11(30) 44(50) 20 22
S2 0(30) 9 14 14 44 0 --
S3 6(10) 6(20) 16(40) 14 44 0 --
Demand 0 0 20 0 0
Column
-- -- 22 -- --
Penalty

The maximum penalty, 22, occurs in row S1.

The minimum cij in this row is c13=22.

The maximum allocation in this cell is min(20,20) = 20.

It satisfy supply of S1 and demand of D3.

Initial feasible solution is

D1 D2 D3 D4 Ddummy Supply Row Penalty
S1 4 19 22(20) 11(30) 44(50) 100 7 | 7 | 7 | 11 | 22 | 22 | 22 |
S2 0(30) 9 14 14 44 30 9 | -- | -- | -- | -- | -- | -- |
S3 6(10) 6(20) 16(40) 14 44 70 0 | 0 | 8 | 2 | 28 | -- | -- |

Demand 40 20 60 30 50
4 3 2 3 0
2 13 6 3 0
2 -- 6 3 0
Column
-- -- 6 3 0
Penalty
-- -- 6 -- 0
-- -- 22 -- 44
-- -- 22 -- --

Allocations in the original problem

D1 D2 D3 D4 Ddummy Supply
S1 40 25 22 (20) 33 (30) 0 (50) 100
S2 44 (30) 35 30 30 0 30
S3 38 (10) 38 (20) 28 (40) 30 0 70

Demand 40 20 60 30 50

The maximum profit =22×20+33×30+0×50+44×30+38×10+38×20+28×40=5010

Here, the number of allocated cells = 7 is equal to m + n - 1 = 3 + 5 - 1 = 7

∴ This solution is non-degenerate

Optimality test using modi method...

Allocation Table is
D1 D2 D3 D4 Ddummy Supply
S1 4 19 22 (20) 11 (30) 44 (50) 100
S2 0 (30) 9 14 14 44 30
S3 6 (10) 6 (20) 16 (40) 14 44 70

Demand 40 20 60 30 50

Iteration-1 of optimality test

1. Find ui and vj for all occupied cells(i,j), where cij=ui+vj

1. Substituting, u1=0, we get

2.c13=u1+v3⇒v3=c13-u1⇒v3=22-0⇒v3=22

3.c33=u3+v3⇒u3=c33-v3⇒u3=16-22⇒u3=-6

4.c31=u3+v1⇒v1=c31-u3⇒v1=6+6⇒v1=12

5.c21=u2+v1⇒u2=c21-v1⇒u2=0-12⇒u2=-12

6.c32=u3+v2⇒v2=c32-u3⇒v2=6+6⇒v2=12

7.c14=u1+v4⇒v4=c14-u1⇒v4=11-0⇒v4=11

8.c15=u1+v5⇒v5=c15-u1⇒v5=44-0⇒v5=44

D1 D2 D3 D4 Ddummy Supply ui
S1 4 19 22 (20) 11 (30) 44 (50) 100 u1=0
S2 0 (30) 9 14 14 44 30 u2=-12
S3 6 (10) 6 (20) 16 (40) 14 44 70 u3=-6

Demand 40 20 60 30 50
vj v1=12 v2=12 v3=22 v4=11 v5=44

( )
2. Find dij for all unoccupied cells(i,j), where dij=cij- ui+vj
 ( )
1.d11=c11- u1+v1 =4-(0+12)=-8

( )
2.d12=c12- u1+v2 =19-(0+12)=7

( )
3.d22=c22- u2+v2 =9-(-12+12)=9

( )
4.d23=c23- u2+v3 =14-(-12+22)=4

( )
5.d24=c24- u2+v4 =14-(-12+11)=15

( )
6.d25=c25- u2+v5 =44-(-12+44)=12

( )
7.d34=c34- u3+v4 =14-(-6+11)=9

( )
8.d35=c35- u3+v5 =44-(-6+44)=6

D1 D2 D3 D4 Ddummy Supply ui
S1 4 [-8] 19 [7] 22 (20) 11 (30) 44 (50) 100 u1=0
S2 0 (30) 9 [9] 14 [4] 14 [15] 44 [12] 30 u2=-12
S3 6 (10) 6 (20) 16 (40) 14 [9] 44 [6] 70 u3=-6

Demand 40 20 60 30 50
vj v1=12 v2=12 v3=22 v4=11 v5=44

3. Now choose the minimum negative value from all dij (opportunity cost) = d11 = [-8]

and draw a closed path from S1D1.

Closed path is S1D1→S1D3→S3D3→S3D1

Closed path and plus/minus sign allocation...

D1 D2 D3 D4 Ddummy Supply ui
S1 4 [-8] (+) 19 [7] 22 (20) (-) 11 (30) 44 (50) 100 u1=0
S2 0 (30) 9 [9] 14 [4] 14 [15] 44 [12] 30 u2=-12
S3 6 (10) (-) 6 (20) 16 (40) (+) 14 [9] 44 [6] 70 u3=-6

Demand 40 20 60 30 50
vj v1=12 v2=12 v3=22 v4=11 v5=44

4. Minimum allocated value among all negative position (-) on closed path = 10
Substract 10 from all (-) and Add it to all (+)
D1 D2 D3 D4 Ddummy Supply
S1 4 (10) 19 22 (10) 11 (30) 44 (50) 100
S2 0 (30) 9 14 14 44 30
S3 6 6 (20) 16 (50) 14 44 70

Demand 40 20 60 30 50

5. Repeat the step 1 to 4, until an optimal solution is obtained.

Iteration-2 of optimality test

1. Find ui and vj for all occupied cells(i,j), where cij=ui+vj

1. Substituting, u1=0, we get

2.c11=u1+v1⇒v1=c11-u1⇒v1=4-0⇒v1=4

3.c21=u2+v1⇒u2=c21-v1⇒u2=0-4⇒u2=-4

4.c13=u1+v3⇒v3=c13-u1⇒v3=22-0⇒v3=22

5.c33=u3+v3⇒u3=c33-v3⇒u3=16-22⇒u3=-6

6.c32=u3+v2⇒v2=c32-u3⇒v2=6+6⇒v2=12

7.c14=u1+v4⇒v4=c14-u1⇒v4=11-0⇒v4=11

8.c15=u1+v5⇒v5=c15-u1⇒v5=44-0⇒v5=44

D1 D2 D3 D4 Ddummy Supply ui
S1 4 (10) 19 22 (10) 11 (30) 44 (50) 100 u1=0
S2 0 (30) 9 14 14 44 30 u2=-4
S3 6 6 (20) 16 (50) 14 44 70 u3=-6
Demand 40 20 60 30 50
vj v1=4 v2=12 v3=22 v4=11 v5=44

( )
2. Find dij for all unoccupied cells(i,j), where dij=cij- ui+vj

( )
1.d12=c12- u1+v2 =19-(0+12)=7

( )
2.d22=c22- u2+v2 =9-(-4+12)=1

( )
3.d23=c23- u2+v3 =14-(-4+22)=-4

( )
4.d24=c24- u2+v4 =14-(-4+11)=7

( )
5.d25=c25- u2+v5 =44-(-4+44)=4

( )
6.d31=c31- u3+v1 =6-(-6+4)=8

( )
7.d34=c34- u3+v4 =14-(-6+11)=9

( )
8.d35=c35- u3+v5 =44-(-6+44)=6

D1 D2 D3 D4 Ddummy Supply ui
S1 4 (10) 19 [7] 22 (10) 11 (30) 44 (50) 100 u1=0
S2 0 (30) 9 [1] 14 [-4] 14 [7] 44 [4] 30 u2=-4
S3 6 [8] 6 (20) 16 (50) 14 [9] 44 [6] 70 u3=-6

Demand 40 20 60 30 50
vj v1=4 v2=12 v3=22 v4=11 v5=44

3. Now choose the minimum negative value from all dij (opportunity cost) = d23 = [-4]

and draw a closed path from S2D3.

Closed path is S2D3→S2D1→S1D1→S1D3

Closed path and plus/minus sign allocation...
D1 D2 D3 D4 Ddummy Supply ui
S1 4 (10) (+) 19 [7] 22 (10) (-) 11 (30) 44 (50) 100 u1=0
S2 0 (30) (-) 9 [1] 14 [-4] (+) 14 [7] 44 [4] 30 u2=-4
S3 6 [8] 6 (20) 16 (50) 14 [9] 44 [6] 70 u3=-6

Demand 40 20 60 30 50
vj v1=4 v2=12 v3=22 v4=11 v5=44

4. Minimum allocated value among all negative position (-) on closed path = 10
Substract 10 from all (-) and Add it to all (+)
D1 D2 D3 D4 Ddummy Supply
S1 4 (20) 19 22 11 (30) 44 (50) 100
S2 0 (20) 9 14 (10) 14 44 30
S3 6 6 (20) 16 (50) 14 44 70

Demand 40 20 60 30 50

5. Repeat the step 1 to 4, until an optimal solution is obtained.

Iteration-3 of optimality test

1. Find ui and vj for all occupied cells(i,j), where cij=ui+vj

1. Substituting, u1=0, we get

2.c11=u1+v1⇒v1=c11-u1⇒v1=4-0⇒v1=4

3.c21=u2+v1⇒u2=c21-v1⇒u2=0-4⇒u2=-4

4.c23=u2+v3⇒v3=c23-u2⇒v3=14+4⇒v3=18

5.c33=u3+v3⇒u3=c33-v3⇒u3=16-18⇒u3=-2

6.c32=u3+v2⇒v2=c32-u3⇒v2=6+2⇒v2=8

7.c14=u1+v4⇒v4=c14-u1⇒v4=11-0⇒v4=11

8.c15=u1+v5⇒v5=c15-u1⇒v5=44-0⇒v5=44
 D1 D2 D3 D4 Ddummy Supply ui
S1 4 (20) 19 22 11 (30) 44 (50) 100 u1=0
S2 0 (20) 9 14 (10) 14 44 30 u2=-4
S3 6 6 (20) 16 (50) 14 44 70 u3=-2

Demand 40 20 60 30 50
vj v1=4 v2=8 v3=18 v4=11 v5=44

( )
2. Find dij for all unoccupied cells(i,j), where dij=cij- ui+vj

( )
1.d12=c12- u1+v2 =19-(0+8)=11

( )
2.d13=c13- u1+v3 =22-(0+18)=4

( )
3.d22=c22- u2+v2 =9-(-4+8)=5

( )
4.d24=c24- u2+v4 =14-(-4+11)=7

( )
5.d25=c25- u2+v5 =44-(-4+44)=4

( )
6.d31=c31- u3+v1 =6-(-2+4)=4

( )
7.d34=c34- u3+v4 =14-(-2+11)=5

( )
8.d35=c35- u3+v5 =44-(-2+44)=2

D1 D2 D3 D4 Ddummy Supply ui
S1 4 (20) 19 [11] 22 [4] 11 (30) 44 (50) 100 u1=0
S2 0 (20) 9 [5] 14 (10) 14 [7] 44 [4] 30 u2=-4
S3 6 [4] 6 (20) 16 (50) 14 [5] 44 [2] 70 u3=-2

Demand 40 20 60 30 50
vj v1=4 v2=8 v3=18 v4=11 v5=44
Since all dij≥0.

So final optimal solution is arrived.

D1 D2 D3 D4 Ddummy Supply
S1 4 (20) 19 22 11 (30) 44 (50) 100
S2 0 (20) 9 14 (10) 14 44 30
S3 6 6 (20) 16 (50) 14 44 70

Demand 40 20 60 30 50

Allocations in the original problem

D1 D2 D3 D4 Ddummy Supply
S1 40 (20) 25 22 33 (30) 0 (50) 100
S2 44 (20) 35 30 (10) 30 0 30
S3 38 38 (20) 28 (50) 30 0 70

Demand 40 20 60 30 50

The maximum profit =40×20+33×30+0×50+44×20+30×10+38×20+28×50=5130