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 1 9

Demand 4 4 6 2 4 2

Initial feasible solution is

Suppl
D1 D2 D3 D4 D5 D6 Row Penalty
y

9(1
S1 12 9(4) 6 9 10 5  3 |  3 |  0 |  0 |  0 |  0 |  0 |  0 |  9 |
)

3(4
S2 7 7(2) 7 5 5 6  2 |  2 |  2 |  4 |  0 |  0 |  0 | -- | -- |
)

6(2
S3 5 9 11 3 11 2  2 |  2 |  2 |  1 |  3 |  3 | -- | -- | -- |
)

6(1 2(2 2(4 1(2

S4 8 11 9  1 |  0 |  4 |  2 |  5 | -- | -- | -- | -- |
) ) ) )

Demand 4 4 6 2 4 2

0 2 2 4 1 4
0 2 2 4 1 --
0 2 2 -- 1 --
0 2 2 -- -- --
Column
0 -- 2 -- -- --
Penalty
1 -- 2 -- -- --
2 -- 2 -- -- --
9 -- 9 -- -- --
9 -- -- -- -- --

The minimum total transportation cost =9×1+9×4+3×4+7×2+6×2+6×1+2×2+2×4+1×2=103

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

∴ This solution is non-degenerate

Optimality test using modi method...

Allocation Table is
D1 D2 D3 D4 D5 D6 Supply

9 (1 9 (4
S1 12 6 9 10 5
) )
 3 (4 7 (2
S2 7 7 5 5 6
) )

6 (2
S3 5 9 11 3 11 2
)

6 (1 2 (4 1 (2

S4 8 11 2 (2) 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, u4=0, we get

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

3.c11=u1+v1⇒u1=c11-v1⇒u1=9-6⇒u1=3

4.c13=u1+v3⇒v3=c13-u1⇒v3=9-3⇒v3=6

5.c23=u2+v3⇒u2=c23-v3⇒u2=7-6⇒u2=1

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

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

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

9.c45=u4+v5⇒v5=c45-u4⇒v5=2-0⇒v5=2

10.c46=u4+v6⇒v6=c46-u4⇒v6=1-0⇒v6=1

Suppl
D1 D2 D3 D4 D5 D6 ui
y

9 (1 9 (4
S1 12 6 9 10 5 u1=3
) )

3 (4 7 (2
S2 7 7 5 5 6 u2=1
) )

6 (2
S3 5 9 11 3 11 2 u3=0
)

6 (1 2 (2 2 (4 1 (2

S4 8 11 9 u4=0
) ) ) )

Demand 4 4 6 2 4 2

vj v1=6 v2=2 v3=6 v4=2 v5=2 v6=1

( )
2. Find dij for all unoccupied cells(i,j), where dij=cij- ui+vj
 ( ) ( ) ( )
1.d12=c12- u1+v2 =12-(3+2)=7 2.d14=c14- u1+v4 =6-(3+2)=1 3.d15=c15- u1+v5 =9-(3+2)=4

4.d =c -(u +v )=10-(3+1)=6 5.d =c -(u +v )=7-(1+6)=0 6.d =c -(u +v )=7-(1+2)=4

16 16 1 6 21 21 2 1 24 24 2 4

7.d =c -(u +v )=5-(1+2)=2 8.d =c -(u +v )=5-(1+1)=3 9.d =c -(u +v )=5-(0+2)=3

25 25 2 5 26 26 2 6 32 32 3 2

10.d =c -(u +v )=9-(0+6)=3 11.d =c -(u +v )=11-(0+2)=9 12.d =c -(u +v )=3-(0+2)=1

33 33 3 3 34 34 3 4 35 35 3 5

13.d =c -(u +v )=11-(0+1)=10 14.d =c -(u +v )=8-(0+2)=6 15.d =c -(u +v )=11-(0+6)=5

36 36 3 6 42 42 4 2 43 43 4 3

D1 D2 D3 D4 D5 D6 Supply ui

9 (1 12 [7
S1 9 (4) 6 [1] 9 [4] 10 [6] 5 u1=3
) ]

S2 7 [0] 3 (4) 7 (2) 7 [4] 5 [2] 5 [3] 6 u2=1

6 (2 11 [10
S3 5 [3] 9 [3] 11 [9] 3 [1] 2 u3=0
) ]

6 (1 2 (4
S4 8 [6] 11 [5] 2 (2) 1 (2) 9 u4=0
) )

Demand 4 4 6 2 4 2

vj v1=6 v2=2 v3=6 v4=2 v5=2 v6=1

Since all dij≥0.

So final optimal solution is arrived.

D1 D2 D3 D4 D5 D6 Supply

9 (1 9 (4
S1 12 6 9 10 5
) )

3 (4 7 (2
S2 7 7 5 5 6
) )

6 (2
S3 5 9 11 3 11 2
)

6 (1 2 (4 1 (2

S4 8 11 2 (2) 9
) ) )

Demand 4 4 6 2 4 2

The minimum total transportation cost =9×1+9×4+3×4+7×2+6×2+6×1+2×2+2×4+1×2=103

(SAME FOR THREE METHOD)

9 Solution:
TOTAL number of supply constraints : 3
TOTAL number of demand constraints : 5
Problem Table is
D1 D2 D3 D4 D5 Supply

S1 3 2 3 4 1 100

S2 4 1 2 4 2 125

S3 1 0 5 3 2 75

Demand 100 60 40 75 25

Initial feasible solution is

D1 D2 D3 D4 D5 Supply Row Penalty

3(25 1(25
S1 2 3 4(50) 100  1 |  1 |  2 |  0 |  1 |  4 | -- |
) )

S2 4 1(60) 2(40) 4(25) 2 125  1 |  1 |  0 |  2 |  0 |  4 |  4 |

1(75
S3 0 5 3 2 75  1 | -- | -- | -- | -- | -- | -- |
)

Demand 100 60 40 75 25

2 1 1 1 1
1 1 1 0 1
1 -- 1 0 1
Column
1 -- 1 0 --
Penalty
1 -- -- 0 --
-- -- -- 0 --
-- -- -- 4 --

The minimum total transportation cost =3×25+4×50+1×25+1×60+2×40+4×25+1×75=615

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 D5 Supply

3 (25 4 (50
S1 2 3 1 (25) 100
) )

4 (25
S2 4 1 (60) 2 (40) 2 125
)
 1 (75
S3 0 5 3 2 75
)

Demand 100 60 40 75 25

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=3-0⇒v1=3

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

4.c14=u1+v4⇒v4=c14-u1⇒v4=4-0⇒v4=4

 5.c24=u2+v4⇒u2=c24-v4⇒u2=4-4⇒u2=0

6.c22=u2+v2⇒v2=c22-u2⇒v2=1-0⇒v2=1

7.c23=u2+v3⇒v3=c23-u2⇒v3=2-0⇒v3=2

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

D1 D2 D3 D4 D5 Supply ui

3 (25
S1 2 3 4 (50) 1 (25) 100 u1=0
)

2 (40
S2 4 1 (60) 4 (25) 2 125 u2=0
)

1 (75
S3 0 5 3 2 75 u3=-2
)

Demand 100 60 40 75 25

vj v1=3 v2=1 v3=2 v4=4 v5=1

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

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

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

( )
3.d21=c21- u2+v1 =4-(0+3)=1
 ( )
4.d25=c25- u2+v5 =2-(0+1)=1

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

( )
6.d33=c33- u3+v3 =5-(-2+2)=5

( )
7.d34=c34- u3+v4 =3-(-2+4)=1

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

D1 D2 D3 D4 D5 Supply ui

3 (25
S1 2 [1] 3 [1] 4 (50) 1 (25) 100 u1=0
)

2 (40
S2 4 [1] 1 (60) 4 (25) 2 [1] 125 u2=0
)

1 (75
S3 0 [1] 5 [5] 3 [1] 2 [3] 75 u3=-2
)

Demand 100 60 40 75 25

vj v1=3 v2=1 v3=2 v4=4 v5=1

Since all dij≥0.

So final optimal solution is arrived.

D1 D2 D3 D4 D5 Supply

3 (25 4 (50
S1 2 3 1 (25) 100
) )

4 (25
S2 4 1 (60) 2 (40) 2 125
)

1 (75
S3 0 5 3 2 75
)

Demand 100 60 40 75 25

The minimum total transportation cost =3×25+4×50+1×25+1×60+2×40+4×25+1×75=615

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

D1 D2 D3 D4 Supply

S1 11 13 17 14 250

S2 16 18 14 10 300

S3 21 24 13 10 400

20 25
Demand 225 275
0 0
Initial feasible solution is
D1 D2 D3 D4 Supply Row Penalty

S1 11(200) 13(50) 17 14 250  2 |  1 | -- | -- | -- | -- |

18(175
S2 16 14 10(125) 300  4 |  4 |  4 |  4 | -- | -- |
)

 3 |  3 |  3 |  3 |  3 | 10
S3 21 24 13(275) 10(125) 400
|

Demand 200 225 275 250

5 5 1 0
-- 5 1 0
Column -- 6 1 0
Penalty -- -- 1 0
-- -- 13 10
-- -- -- 10

The minimum total transportation cost =11×200+13×50+18×175+10×125+13×275+10×125=12075

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

11 (200
S1 13 (50) 17 14 250
)

10 (125
S2 16 18 (175) 14 300
)

13 (275 10 (125
S3 21 24 400
) )

Demand 200 225 275 250

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=11-0⇒v1=11

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

4.c22=u2+v2⇒u2=c22-v2⇒u2=18-13⇒u2=5

 5.c24=u2+v4⇒v4=c24-u2⇒v4=10-5⇒v4=5

6.c34=u3+v4⇒u3=c34-v4⇒u3=10-5⇒u3=5

7.c33=u3+v3⇒v3=c33-u3⇒v3=13-5⇒v3=8

D1 D2 D3 D4 Supply ui

11 (200
S1 13 (50) 17 14 250 u1=0
)

S2 16 18 (175) 14 10 (125) 300 u2=5

13 (275
S3 21 24 10 (125) 400 u3=5
)

Demand 200 225 275 250

vj v1=11 v2=13 v3=8 v4=5

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

( )
1.d13=c13- u1+v3 =17-(0+8)=9

( )
2.d14=c14- u1+v4 =14-(0+5)=9

( )
3.d21=c21- u2+v1 =16-(5+11)=0

( )
4.d23=c23- u2+v3 =14-(5+8)=1

( )
5.d31=c31- u3+v1 =21-(5+11)=5

( )
6.d32=c32- u3+v2 =24-(5+13)=6

D1 D2 D3 D4 Supply ui

S1 11 (200 13 (50) 17 [9] 14 [9] 250 u1=0

 )

S2 16 [0] 18 (175) 14 [1] 10 (125) 300 u2=5

13 (275
S3 21 [5] 24 [6] 10 (125) 400 u3=5
)

Demand 200 225 275 250

vj v1=11 v2=13 v3=8 v4=5

Since all dij≥0.

So final optimal solution is arrived.

D1 D2 D3 D4 Supply

11 (200
S1 13 (50) 17 14 250
)

10 (125
S2 16 18 (175) 14 300
)

13 (275 10 (125
S3 21 24 400
) )

Demand 200 225 275 250

The minimum total transportation cost =11×200+13×50+18×175+10×125+13×275+10×125=12075

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

D1 D2 D3 D4 Supply

S1 6 1 9 3 70

S2 11 5 2 8 55

S3 10 12 4 7 70

Demand 85 35 50 45
Initial feasible solution is
D1 D2 D3 D4 Supply Row Penalty

S1 6 1(35) 9 3(35) 70  2 |  2 |  3 |  3 | -- | -- | -- |

S2 11(5) 5 2(50) 8 55  3 |  3 |  6 |  3 |  3 | 11 | -- |

S3 10(60) 12 4 7(10) 70  3 |  3 |  3 |  3 |  3 | 10 | 10 |

Sdummy 0(20) 0 0 0 20  0 | -- | -- | -- | -- | -- | -- |

Demand 85 35 50 45

6 1 2 3
4 4 2 4
4 -- 2 4
Column
4 -- -- 4
Penalty
1 -- -- 1
1 -- -- --
10 -- -- --

The minimum total transportation cost =1×35+3×35+11×5+2×50+10×60+7×10+0×20=965

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

∴ This solution is non-degenerate

Optimality test using modi method...

Allocation Table is
D1 D2 D3 D4 Supply

S1 6 1 (35) 9 3 (35) 70

2 (50
S2 11 (5) 5 8 55
)

10 (60
S3 12 4 7 (10) 70
)

Sdummy 0 (20) 0 0 0 20

Demand 85 35 50 45

Iteration-1 of optimality test

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

1. Substituting, v1=0, we get

2.c21=u2+v1⇒u2=c21-v1⇒u2=11-0⇒u2=11

3.c23=u2+v3⇒v3=c23-u2⇒v3=2-11⇒v3=-9
4.c31=u3+v1⇒u3=c31-v1⇒u3=10-0⇒u3=10

5.c34=u3+v4⇒v4=c34-u3⇒v4=7-10⇒v4=-3

6.c14=u1+v4⇒u1=c14-v4⇒u1=3+3⇒u1=6

7.c12=u1+v2⇒v2=c12-u1⇒v2=1-6⇒v2=-5

8.c41=u4+v1⇒u4=c41-v1⇒u4=0-0⇒u4=0

D1 D2 D3 D4 Supply ui

1 (35 3 (35
S1 6 9 70 u1=6
) )

2 (50
S2 11 (5) 5 8 55 u2=11
)

7 (10
S3 10 (60) 12 4 70 u3=10
)

Sdummy 0 (20) 0 0 0 20 u4=0

Demand 85 35 50 45

vj v1=0 v2=-5 v3=-9 v4=-3

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

( ) ( ) ( )
1.d11=c11- u1+v1 =6-(6+0)=0 2.d13=c13- u1+v3 =9-(6-9)=12 3.d22=c22- u2+v2 =5-(11-5)=-1

4.d24=c24-(u +v )=8-(11-3)=0 5.d =c -(u +v )=12-(10-5)=7 6.d =c -(u +v )=4-(10-9)=3

2 4 32 32 3 2 33 33 3 3

7.d42=c42-(u +v )=0-(0-5)=5 8.d =c -(u +v )=0-(0-9)=9 9.d =c -(u +v )=0-(0-3)=3

4 2 43 43 4 3 44 44 4 4

D1 D2 D3 D4 Supply ui

1 (35 3 (35
S1 6 [0] 9 [12] 70 u1=6
) )

2 (50
S2 11 (5) 5 [-1] 8 [0] 55 u2=11
)

7 (10
S3 10 (60) 12 [7] 4 [3] 70 u3=10
)

Sdummy 0 (20) 0 [5] 0 [9] 0 [3] 20 u4=0

Demand 85 35 50 45

vj v1=0 v2=-5 v3=-9 v4=-3

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

Closed path is S2D2→S2D1→S3D1→S3D4→S1D4→S1D2

Closed path and plus/minus sign allocation...

D1 D2 D3 D4 Supply ui

3 (35) (+
S1 6 [0] 1 (35) (-) 9 [12] 70 u1=6
)

2 (50
S2 11 (5) (-) 5 [-1] (+) 8 [0] 55 u2=11
)

10 (60) (+
S3 12 [7] 4 [3] 7 (10) (-) 70 u3=10
)

Sdummy 0 (20) 0 [5] 0 [9] 0 [3] 20 u4=0

Demand 85 35 50 45

vj v1=0 v2=-5 v3=-9 v4=-3

4. Minimum allocated value among all negative position (-) on closed path = 5

Substract 5 from all (-) and Add it to all (+)
D1 D2 D3 D4 Supply

S1 6 1 (30) 9 3 (40) 70

2 (50
S2 11 5 (5) 8 55
)

10 (65
S3 12 4 7 (5) 70
)

Sdummy 0 (20) 0 0 0 20

Demand 85 35 50 45

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.c12=u1+v2⇒v2=c12-u1⇒v2=1-0⇒v2=1

 3.c22=u2+v2⇒u2=c22-v2⇒u2=5-1⇒u2=4

4.c23=u2+v3⇒v3=c23-u2⇒v3=2-4⇒v3=-2

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

6.c34=u3+v4⇒u3=c34-v4⇒u3=7-3⇒u3=4
7.c31=u3+v1⇒v1=c31-u3⇒v1=10-4⇒v1=6

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

D1 D2 D3 D4 Supply ui

3 (40
S1 6 1 (30) 9 70 u1=0
)

2 (50
S2 11 5 (5) 8 55 u2=4
)

10 (65
S3 12 4 7 (5) 70 u3=4
)

Sdummy 0 (20) 0 0 0 20 u4=-6

Demand 85 35 50 45

vj v1=6 v2=1 v3=-2 v4=3

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

( ) ( )
1.d11=c11- u1+v1 =6-(0+6)=0 2.d13=c13- u1+v3 =9-(0-2)=11 ( )
3.d21=c21- u2+v1 =11-(4+6)=1

4.d24=c24-(u +v )=8-(4+3)=1 5.d =c -(u +v )=12-(4+1)=7

2 4 32 32 3 2 -(u +v )=4-(4-2)=2
6.d33=c33 3 3

7.d42=c42-(u +v )=0-(-6+1)=5 8.d =c -(u +v )=0-(-6-2)=8

4 2 43 43 4 3 -(u +v )=0-(-6+3)=3
9.d44=c44 4 4

D1 D2 D3 D4 Supply ui

3 (40
S1 6 [0] 1 (30) 9 [11] 70 u1=0
)

2 (50
S2 11 [1] 5 (5) 8 [1] 55 u2=4
)

10 (65
S3 12 [7] 4 [2] 7 (5) 70 u3=4
)

Sdummy 0 (20) 0 [5] 0 [8] 0 [3] 20 u4=-6

Demand 85 35 50 45

vj v1=6 v2=1 v3=-2 v4=3

Since all dij≥0.
So final optimal solution is arrived.
D1 D2 D3 D4 Supply

S1 6 1 (30) 9 3 (40) 70

S2 11 5 (5) 2 (50 8 55
 )

10 (65
S3 12 4 7 (5) 70
)

Sdummy 0 (20) 0 0 0 20

Demand 85 35 50 45

The minimum total transportation cost =1×30+3×40+5×5+2×50+10×65+7×5+0×20=960

B18 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 18 9 70

Demand 30 25 35 40

Initial feasible solution is

Suppl
D1 D2 D3 D4 Ddummy Row Penalty
y

7(35
S1 11 20 8(15) 0 50  7 |  1 |  3 |  3 |  3 |  8 |  8 |
)

S2 21 16 20 12(10) 0(30) 40 12 |  4 |  4 |  9 | -- | -- | -- |

S3 8(30) 12(25) 18 9(15) 0 70  8 |  1 |  1 |  1 |  1 |  9 | -- |

Demand 30 25 35 40 30

3 4 11 1 0
3 4 11 1 --
3 4 -- 1 --
Column
3 -- -- 1 --
Penalty
3 -- -- 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

7 (35
S1 11 20 8 (15) 0 50
)

S2 21 16 20 12 (10) 0 (30) 40

S3 8 (30) 12 (25) 18 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

7 (35
S1 11 20 8 (15) 0 50 u1=-1
)

S2 21 16 20 12 (10) 0 (30) 40 u2=3

8 (30 12 (25
S3 18 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-(u +v )=21-(3+8)=10
2 1 5.d22=c22 -(u +v )=16-(3+12)=1
2 2 -(u +v )=20-(3+8)=9
6.d23=c23 2 3
 ( )
7.d33=c33- u3+v3 =18-(0+8)=10 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

21 [10
S2 16 [1] 20 [9] 12 (10) 0 (30) 40 u2=3
]

18 [10
S3 8 (30) 12 (25) 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

7 (35
S1 11 20 8 (15) 0 50
)

S2 21 16 20 12 (10) 0 (30) 40

S3 8 (30) 12 (25) 18 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

B25

Initial feasible solution is

D1 D2 D3 D4 Supply Row Penalty

3(9
S1 5 1(25) 3 34  2 |  0 |  2 |  2 | -- | -- | -- |
)

S2 3(15) 3 5 4 15  0 |  1 |  2 | -- | -- | -- | -- |

4(8
S3 6(4) 4 3 12  1 |  1 |  2 |  2 |  2 |  6 | -- |
)

 2 |  2 |  0 |  0 |  0 |  4 |  4
S4 4(2) -1 4 2(17) 19
|

Demand 21 25 17 17

Column 1 2 1 1
Penalty 1 -- 1 1
1 -- 1 --
 1 -- 1 --
2 -- 0 --
2 -- -- --
4 -- -- --

The minimum total transportation cost =1×25+3×9+3×15+6×4+4×8+4×2+2×17=195

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

∴ This solution is non-degenerate

B26 Solution:
TOTAL number of supply constraints : 3
TOTAL number of demand constraints : 4

D1 D2 D3 D4 Supply

S1 30 25 40 20 100

S2 29 26 35 40 250

S3 31 33 37 30 150

16
Demand 90 200 50
0

Initial feasible solution is

D1 D2 D3 D4 Supply Row Penalty

20(50
S1 30 25(50) 40 100  5 |  5 | -- | -- | -- | -- |
)

26(110
S2 29(90) 35(50) 40 250  3 |  3 |  3 |  6 | 35 | 35 |
)

S3 31 33 37(150) 30 150  1 |  2 |  2 |  6 | 37 | -- |

Demand 90 160 200 50

1 1 2 10
1 1 2 --
Column 2 7 2 --
Penalty 2 -- 2 --
-- -- 2 --
-- -- 35 --

The minimum total transportation cost =25×50+20×50+29×90+26×110+35×50+37×150=15020

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

∴ This solution is non-degenerate

Assignment
14B24 Find Solution of Assignment problem using Hungarian method-1 (MIN case)

Work \Job 1 2 3 4
2
A 20 25 28
2
2
B 15 18 17
3
2
C 19 17 24
1
2
D 25 23 24
4

Solution:
The number of rows = 4 and columns = 4
 1  2  3  4

 A 20 25 22 28

 B 15 18 23 17

 C 19 17 21 24

 D 25 23 24 24

Here given problem is balanced.

Step-1: Find out the each row minimum element and subtract it from that row
 1  2  3  4

 A 0 5 2 8 (-20)

 B 0 3 8 2 (-15)

 C 2 0 4 7 (-17)

 D 2 0 1 1 (-23)

Step-2: Find out the each column minimum element and subtract it from that column.
 1  2  3  4

 A 0 5 1 7

 B 0 3 7 1

 C 2 0 3 6

 D 2 0 0 0

(-
(-0) (-0) (-1)
1)
Iteration-1 of steps 3 to 6
Step-3: Make assignment in the opporunity cost table
Step-3: Make assignment in the opporunity cost table
(1) Rowwise cell (A,1) is assigned, so columnwise cell (B,1) crossed off.

(2) Rowwise cell (C,2) is assigned, so columnwise cell (D,2) crossed off.

(3) Columnwise cell (D,3) is assigned, so rowwise cell (D,4) crossed off.

Rowwise & columnwise assignment shown in table

 1  2  3  4

 A [0] 5 1 7

 B 0 3 7 1

 C 2 [0] 3 6

[0
 D 2 0 0
]

Step-4: Number of assignments = 3, number of rows = 4

Which is not equal, so solution is not optimal.

Step-5: Draw a set of horizontal and vertical lines to cover all the 0
Step-5: Cover the 0 with minimum number of lines
(1) Mark(✓) row B since it has no assignment

(2) Mark(✓) column 1 since row B has 0 in this column

(3) Mark(✓) row A since column 1 has an assignment in this row A.

(4) Since no other rows or columns can be marked, therefore draw straight lines through the
unmarked rows C,D and marked columns 1

Tick mark not allocated rows and allocated columns

 1  2  3  4

 A [0] 5 1 7 ✓(3)

 B 0 3 7 1 ✓(1)

[0
 C 2 3 6
]

 D 2 0 [0] 0
✓
(2)

Step-6: Develop the new revised opportunity cost table

Step-6: Develop the new revised table by selecting the smallest element, among the cells not
covered by any line (say k = 1)
Subtract k = 1 from every element in the cell not covered by a line.
Add k = 1 to every elment in the intersection cell of two lines.

 1  2  3  4

 A 0 4 0 6

 B 0 2 6 0

 C 3 0 3 6

 D 3 0 0 0

Repeat steps 3 to 6 until an optimal solution is obtained.

Iteration : 1
Iteration-2 of steps 3 to 6
Step-3: Make assignment in the opporunity cost table
(1) Rowwise cell (C,2) is assigned, so columnwise cell (D,2) crossed off.

(2) Rowwise cell (A,1) is assigned, so columnwise cell (B,1) crossed off., so rowwise

cell (A,3) crossed off.

(3) Rowwise cell (B,4) is assigned, so columnwise cell (D,4) crossed off.

(4) Rowwise cell (D,3) is assigned

Rowwise & columnwise assignment shown in table

 1  2  3  4

 A [0] 4 0 6

 B 0 2 6 [0]

 C 3 [0] 3 6

 D 3 0 [0] 0

Step-4: Number of assignments = 4, number of rows = 4

Which is equal, so solution is optimal

Optimal assignments are

 1  2  3  4

 A [0] 4 0 6

 B 0 2 6 [0]

 C 3 [0] 3 6

 D 3 0 [0] 0
 Optimal solution is
Wor
Job Cost
k

A 1 20

B 4 17

C 2 17

D 3 24

Total 78

Alternate Solution-2
opporunity cost table
 1  2  3  4

 A 0 4 0 6

 B 0 2 6 0

 C 3 0 3 6

 D 3 0 0 0

Step-3: Make assignment in the opporunity cost table

(1) Rowwise cell (C,2) is assigned, so columnwise cell (D,2) crossed off.

(2) Rowwise cell (A,3) is assigned, so columnwise cell (D,3) crossed off., so rowwise

cell (A,1) crossed off.

(3) Rowwise cell (D,4) is assigned, so columnwise cell (B,4) crossed off.

(4) Rowwise cell (B,1) is assigned

Rowwise & columnwise assignment shown in table

 1  2  3  4

 A 0 4 [0] 6

 B [0] 2 6 0

 C 3 [0] 3 6

 D 3 0 0 [0]

Step-4: Number of assignments = 4, number of rows = 4

Which is equal, so solution is optimal

Optimal assignments are

  1  2  3  4

 A 0 4 [0] 6

 B [0] 2 6 0

 C 3 [0] 3 6

 D 3 0 0 [0]

Optimal solution is
Wor
Job Cost
k

A 3 22

B 1 15

C 2 17

D 4 24

Total 78