TRANSPORTATION PROBLEM

There are two types of transportation problem;

a) Balanced transportation problem, Demand is equal to supply

b) Unbalanced transportation problem; Demand is not equal to supply

NorthWest-Corner-Method

Start the procedure from the northwest corner cell

Allocate least value by comparing Demand and Supply.

Destination supply
Source A B C D
1 3 1 7 4 250
2 2 6 5 9 350
3 8 3 3 2 400
Demand 200 300 350 150 1000

3 1 7 4 250
200 50 250-200=50
50-50=0

2 6 5 9 350
250 100 350-250=100
100-100=0

8 3 3 2 400
250 150 400-250=150
150-150=0

200 300 350 150 1000

200-200=0 300-50=250 350-100=250 150-150=0
250-250=0 250-250=0

This is the final initial basic feasible solution

Total transportation problem =200 × 3 + 50 × 1 + 250 × 6 + 100 × 5 + 250 × 3 + 150 × 2 = 3700

Application of U-V method to optimize the solution

 𝑉1 = 3 𝑉2 = 1 𝑉3 = 0 𝑉4 = −1

𝑈1 = 0 3 1 7 4
200 50

𝑈2 = 5 2 6 5 9
250 100

𝑈3 = 3 8 3 3 2
250 150

𝑈𝑖 + 𝑉𝑗 = 𝐶𝑖𝑗

𝑐𝑜𝑙𝑢𝑚𝑛𝑠 + 𝑟𝑜𝑤 − 1 = 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑎𝑙𝑙𝑜𝑐𝑎𝑡𝑒𝑑 𝑐𝑒𝑙𝑙𝑠

𝑀 + 𝑁 − 1 = 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑎𝑙𝑙𝑜𝑐𝑎𝑡𝑒𝑑 𝑐𝑒𝑙𝑙𝑠
3+4−1=6
The first U is given zero, 𝑈1 = 0. 𝑈1 = 0, 𝑉1 = 3. 𝑈1 = 0, 𝑉2 = 1. 𝑉2 = 1, 𝑈2 = 7. 𝑈2 = 5, 𝑉3 =
0. 𝑉3 = 0, 𝑈3 = 3. 𝑈3 = 3, 𝑉4 = −1

Calculate the penalties of the unallocated cells using the formula 𝑃𝑖𝑗 = 𝑈𝑖 + 𝑉𝑗 −
𝐶𝑖𝑗 , 𝐶𝑖𝑗 𝑖𝑠 𝑡ℎ𝑒 𝑣𝑎𝑙𝑢𝑒 𝑜𝑓 𝑡ℎ𝑒 𝑢𝑛𝑎𝑙𝑙𝑜𝑐𝑎𝑡𝑒𝑑 𝑐𝑒𝑙𝑙

𝐶13 = −7, 𝐶14 = −5, 𝐶21 = 6, 𝐶24 = −5, 𝐶31 = −2, 𝐶32 = 1
Optimality is reached if 𝑃𝑖𝑗 ≤ 0. Since we have some positive penalties then optimality has not been
reached.

Find the new basic cell by identifying the unallocated cell with the highest positive penalty then draw a
closed loop using horizontal and vertical lines only with turning points being at allocated cells. Assign (+)
and (-) at each turning point alternatively starting (+) at the new basic cell.

𝐶21 = 6 is the cell with the highest positive penalty therefore our new basic cell.
 𝑉1 = 3 𝑉2 = 1 𝑉3 = 0 𝑉4 = −1

𝑈1 = 0 3(-) (+)1 7 4
200 50

𝑈2 = 5 (+)2 (-)6 5 9
250 100

𝑈3 = 3 8 3 3 2
250 150

Look at the turning points of the loop in the allocated cell then pick the least negative value, 200. To the
negative turning points(loop cells) subtract 200, to the positive turning points(loop cells) add 200.

𝑉1 = −3 𝑉2 = 1 𝑉3 = 0 𝑉4 = −1

𝑈1 = 0 3 1 7 4
250

𝑈2 = 5 2 6 5 9
200 50 100

𝑈3 = 3 8 3 3 2
250 150

𝑈𝑖 + 𝑉𝑗 = 𝐶𝑖𝑗

𝑐𝑜𝑙𝑢𝑚𝑛𝑠 + 𝑟𝑜𝑤 − 1 = 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑎𝑙𝑙𝑜𝑐𝑎𝑡𝑒𝑑 𝑐𝑒𝑙𝑙𝑠

𝑀 + 𝑁 − 1 = 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑎𝑙𝑙𝑜𝑐𝑎𝑡𝑒𝑑 𝑐𝑒𝑙𝑙𝑠
3+4−1=6
Calculate the penalties of the unallocated cells using the formula 𝑃𝑖𝑗 = 𝑈𝑖 + 𝑉𝑗 −
𝐶𝑖𝑗 , 𝐶𝑖𝑗 𝑖𝑠 𝑡ℎ𝑒 𝑣𝑎𝑙𝑢𝑒 𝑜𝑓 𝑡ℎ𝑒 𝑢𝑛𝑎𝑙𝑙𝑜𝑐𝑎𝑡𝑒𝑑 𝑐𝑒𝑙𝑙

𝐶11 = −6, 𝐶13 = −7, 𝐶14 = −5, 𝐶24 = −5, 𝐶31 = −8, 𝐶32 = 1 Optimality not reached since we have a
positive penalty value on 𝐶32 = 1 hence our new basic cell. Draw a closed loop starting with cell C32.
 𝑉1 = −3 𝑉2 = 1 𝑉3 = 0 𝑉4 = −1

𝑈1 = 0 3 1 7 4
250

𝑈2 = 5 2 (-)6 (+)5 9
200 50 100

𝑈3 = 3 8 (+)3 (-)3 2
250 150

Look at the turning points of the loop in the allocated basic cell then pick the least negative value, 50. To
the negative turning points(loop cells) subtract 50, to the positive turning points(loop cells) add 50.

𝑉1 = −2 𝑉2 = 1 𝑉3 = 1 𝑉4 = 0

𝑈1 = 0 3 1 7 4
250

𝑈2 = 4 2 6 5 9
200 150

𝑈3 = 2 8 3 3 2
50 200 150

𝑈𝑖 + 𝑉𝑗 = 𝐶𝑖𝑗

𝑐𝑜𝑙𝑢𝑚𝑛𝑠 + 𝑟𝑜𝑤 − 1 = 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑎𝑙𝑙𝑜𝑐𝑎𝑡𝑒𝑑 𝑐𝑒𝑙𝑙𝑠

𝑀 + 𝑁 − 1 = 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑎𝑙𝑙𝑜𝑐𝑎𝑡𝑒𝑑 𝑐𝑒𝑙𝑙𝑠

3+4−1=6
Calculate the penalties of the unallocated cells using the formula 𝑃𝑖𝑗 = 𝑈𝑖 + 𝑉𝑗 −
𝐶𝑖𝑗 , 𝐶𝑖𝑗 𝑖𝑠 𝑡ℎ𝑒 𝑣𝑎𝑙𝑢𝑒 𝑜𝑓 𝑡ℎ𝑒 𝑢𝑛𝑎𝑙𝑙𝑜𝑐𝑎𝑡𝑒𝑑 𝑐𝑒𝑙𝑙
𝐶11 = −5, 𝐶13 = −6, 𝐶14 = −4, 𝐶22 = −1, 𝐶24 = −5, 𝐶31 = −8. 𝑠𝑖𝑛𝑐𝑒 𝑎𝑙𝑙 𝑃𝑖𝑗 ≤
0 𝑡ℎ𝑒𝑛 𝑤𝑒 ℎ𝑎𝑣𝑒 𝑟𝑒𝑎𝑐ℎ𝑒𝑑 𝑜𝑝𝑡𝑖𝑚𝑎𝑙𝑖𝑡𝑦.

Therefore the total cost is;

250 × 1 + 200 × 2 + 150 × 5 + 50 × 3 + 200 × 3 + 150 × 2 = 2450.

Least-Cost-Cell-Method

Destination supply

source 1 2 3 4

1 3 1 7 4 300

2 2 6 5 9 400

3 8 3 3 2 500

Demand 250 350 400 200 1200

Start with the cell with minimum value in the cost matrix

Allocate least value by comparing demand and supply

 3 1 7 4 300
300 300-300=0

2 6 5 9 400
250 150 400-250=150
150-150=0

8 3 3 2 500
50 250 200 500-200=300
300-50=250
250-
250=0

250 350 400 200 1200

250-250=0 350-300=50 400-250=150 200-200=0
50-50=0 150-150=0

𝐶12 → 𝐶21 → 𝐶34 → 𝐶32 → 𝐶33 → 𝐶23

The initial feasible solution 300 × 1 + 250 × 2 + 150 × 5 + 50 × 3 + 250 × 3 + 200 × 2 = 2850

Vogel’s Approximation Method

 Destination supply

source 1 2 3 4

1 3 1 7 4 300

2 2 6 5 9 400

3 8 3 3 2 500

Demand 250 350 400 200 1200

First find row difference and column difference

Select the maximum value among row difference and column difference

Identify the cell for allocation which has least cost in that row or column.
 Row Difference
3 1 7 4 300 2 3 - - - -
300 300-
300=0
2 6 5 9 400 3 - - - - -
250 150 400-
250=150
150-
150=0
8 3 3 2 500 1 1 1 - - -
50 250 200 500-
200=300
300-
50=250
250-
250=0
250 350 400 200 1200
250- 350- 400- 200-
250=0 300=50 250=150 200=0
50- 150-
50=0 150=0
Column 1 2 2 2 1
Difference - 2 2 2 2
- 3 2 7 3
- 3 2 - 4
- - 2 - 5
- - - -

The initial feasible basic solution is 300 × 1 + 250 × 2 + 150 × 5 + 50 × 3 + 250 × 3 + 200 × 2 =
2850
To optimize the solution ,follow the same procedure as conducted under northwest cost cell method.

Unbalanced Transportation Problem

This is a type of transportation problem where demand does not equal the supply.
 Destination Supply
Source A B C D E
1 5 1 8 7 5 15
2 3 9 6 7 8 25
3 4 2 7 6 5 42
4 7 11 10 4 9 35
Demand 30 20 15 10 20
The transportation problem is unbalanced since 𝐷 ≠ 𝑆; 95 ≠ 117

To convert to a balanced problem, add a dummy column.

Destination Supply
Source A B C D E F
1 5 1 8 7 5 0 15
2 3 9 6 7 8 0 25
3 4 2 7 6 5 0 42
4 7 11 10 4 9 0 35
Demand 30 20 15 10 20 22 117

Find initial basic feasible solution, use either NorthWest Corner Cell method, Least-Cost cell Method or
VAM method.

Using NorthWest Corner Cell Method

 Destination Supply
Source A B C D E F
1 5 1 8 7 5 0 15
15 15-
15=0
2 3 9 6 7 8 0 25
15 10 25-15=10
10-
10=0

3 4 2 7 6 5 0 42
10 15 10 7 42-10=32
32-15=17
17-
10=7
7-
7=0

4 7 11 10 4 9 0 35
13 22 35-13=22
22-22=0
Demand 30 20 15 10 20 22 117
30-15=15 20-10=10 15- 10- 20-7=13 22-
15- 10- 15=0 10=0 13- 22=0
15=0 10=0 13=0

Initial basic feasible solution 15 × 5 + 15 × 3 + 10 × 9 + 10 × 2 + 15 × 7 + 10 × 6 + 7 × 5 + 13 ×

9 + 22 × 0 = 547
Find the optimum value as shown in the previous example using northwest corner cell method.

Degeneracy in Transportation Problem

 Destination supply
Source A B C D E
1 10 2 3 15 9 35
2 5 10 15 2 4 40
3 15 5 14 7 15 20
4 20 15 13 25 8 30
Demand 20 20 40 10 35 125

Find the initial basic feasible solution using least cost cell method

10 2 3 15 9 35
20 15 35-
20=15
15-
15=0
5 10 15 2 4 40
10 30 40-
10=30
30-
30=0
15 5 14 7 15 20
20 20-
20=0
20 15 13 25 8 30
25 5 30-
5=25
25-
25=0
20 20 40 10 35 125
20- 20- 40- 10- 35-
20=0 20=0 15=25 10=0 30=5
25- 5-
25=0 5=0

Initial basic feasible transport cost20 × 2 + 15 × 3 + 10 × 2 + 30 × 4 + 20 × 15 + 25 × 13 + 8 × 5 =

890

Optimizing the basic feasible solution using U.V method

Check whether 𝑐𝑜𝑙𝑢𝑚𝑛𝑠 + 𝑟𝑜𝑤 − 1 = 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑎𝑙𝑙𝑜𝑐𝑎𝑡𝑒𝑑 𝑐𝑒𝑙𝑙𝑠

𝑀 + 𝑁 − 1 = 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑎𝑙𝑙𝑜𝑐𝑎𝑡𝑒𝑑 𝑐𝑒𝑙𝑙𝑠

4+5-1=7

8≠7
If No;

Convert the necessary number of unallocated cells into allocated cells to satisfy the following conditions;

Starting from the least value of the unallocated cell

Check the loop formation one by one, there should be no closed loop formation.

Select that cell as a new allocated cell and assign ′𝜀′.

10 2 3 15 9
20 15

5 10 15 2 4
10 30

15 5 14 7 15
20

20 15 13 25 8
25 5

Among the unallocated cells, the least value is 5. Cell 𝐶32 satisfy the condition, no closed loop formation,
therefore its converted to an allocated cell

10 2 3 15 9
20 15

5 10 15 2 4
10 30

15 5 14 7 15
20 𝜀

20 15 13 25 8
25 5

Recheck Check whether 𝑐𝑜𝑙𝑢𝑚𝑛𝑠 + 𝑟𝑜𝑤 − 1 = 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑎𝑙𝑙𝑜𝑐𝑎𝑡𝑒𝑑 𝑐𝑒𝑙𝑙𝑠

𝑀 + 𝑁 − 1 = 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑎𝑙𝑙𝑜𝑐𝑎𝑡𝑒𝑑 𝑐𝑒𝑙𝑙𝑠

4+5-1=8

8=8
 𝑉1 = 2 𝑉2 = 2 𝑉3 = 3 𝑉4 = −4 𝑉5 = −2 Supply

𝑈1 = 0 10 2 3 15 9 35
20 15

𝑈2 = 6 5 10 15 2 4 40
10 30

𝑈3 = 3 15 5 14 7 15 20+𝜀
20 𝜀

𝑈4 20 15 13 25 8 30
= 10 25 5

Demand 20 20+𝜀 40 10 35 125+𝜀

𝑈𝑖 + 𝑉𝑗 = 𝐶𝑖𝑗

Calculate the penalties of the unallocated cells using the formula 𝑃𝑖𝑗 = 𝑈𝑖 + 𝑉𝑗 −
𝐶𝑖𝑗 , 𝐶𝑖𝑗 𝑖𝑠 𝑡ℎ𝑒 𝑣𝑎𝑙𝑢𝑒 𝑜𝑓 𝑡ℎ𝑒 𝑢𝑛𝑎𝑙𝑙𝑜𝑐𝑎𝑡𝑒𝑑 𝑐𝑒𝑙𝑙

𝐶11 = −8, 𝐶14 = −19, 𝐶15 = −11, 𝐶21 = 13, 𝐶22 = −2, 𝐶23 = −6, 𝐶33 = −8, 𝐶34 = −8, 𝐶35 =
−14, 𝐶41 = 2, 𝐶42 = −3, 𝐶44 = −19
Optimality is reached if 𝑃𝑖𝑗 ≤ 0. Since we have some positive penalties, optimality has not been
reached.

Pick the cell with the most positive penalty and consider that cell as the new allocated cell.

From that new particular allocated cell, draw a closed loop using horizontal and vertical lines passing
through some allocated cells. The turning point of the loop should be only at the allocated cells.

𝐶21 = 13, 𝑖𝑠 𝑡ℎ𝑒 𝑚𝑜𝑠𝑡 𝑝𝑜𝑠𝑖𝑡𝑖𝑣𝑒 𝑡ℎ𝑒𝑟𝑒𝑓𝑜𝑟𝑒 𝐶21 𝑖𝑠 𝑡ℎ𝑒 𝑛𝑒𝑤 𝑎𝑙𝑙𝑜𝑐𝑎𝑡𝑒𝑑 𝑐𝑒𝑙𝑙.
 𝑉1 = 2 𝑉2 = 2 𝑉3 = 3 𝑉4 = −4 𝑉5 = −2 Supply

𝑈1 = 0 10 (-)2 (+)3 15 9 35
20 15

𝑈2 = 6 (+)5 10 15 2 (-)4 40
10 30

𝑈3 = 3 (-)15 (+)5 14 7 15 20+𝜀

20 𝜀

𝑈4 20 15 (-)13 25 (+)8 30
= 10 25 5

Demand 20 20+𝜀 40 10 35 125+𝜀

Starting from the new allocated cell, alternatively assign (+) and (-) signs at the corner of the closed
loops.

select the minimum of the allocated value among the (-) signed cells.

Add and subtract that selected minimum value in all the (+) and (-) signed cells respectively.

𝑉1 = 2 𝑉2 = 2 𝑉3 = 3 𝑉4 = −4 𝑉5 = −2 Supply

𝑈1 = 0 10 2 3 15 9 35
35

𝑈2 = 6 5 10 15 2 4 40
20 10 10

𝑈3 = 3 15 5 14 7 15 20+𝜀
20 + 𝜀

𝑈4 20 15 13 25 8 30
= 10 5 25

Demand 20 20+𝜀 40 10 35 125+𝜀

Check whether 𝑐𝑜𝑙𝑢𝑚𝑛𝑠 + 𝑟𝑜𝑤 − 1 = 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑎𝑙𝑙𝑜𝑐𝑎𝑡𝑒𝑑 𝑐𝑒𝑙𝑙𝑠

𝑀 + 𝑁 − 1 = 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑎𝑙𝑙𝑜𝑐𝑎𝑡𝑒𝑑 𝑐𝑒𝑙𝑙𝑠

4+5-1=7

8 ≠ 7, cell 𝐶12satisfy the condition of no closed loop formation therefore our new allocated cell.
 𝑉1 = 2 𝑉2 = 2 𝑉3 = 3 𝑉4 = −4 𝑉5 = −2 Supply

𝑈1 = 0 10 2 3 15 9 35+𝜀
𝜀 35

𝑈2 = 6 5 10 15 2 4 40
20 10 10

𝑈3 = 3 15 5 14 7 15 20+𝜀
20 + 𝜀

𝑈4 20 15 13 25 8 30
= 10 5 25

Demand 20 20+2𝜀 40 10 35 125+2𝜀

Recheck Check whether 𝑐𝑜𝑙𝑢𝑚𝑛𝑠 + 𝑟𝑜𝑤 − 1 = 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑎𝑙𝑙𝑜𝑐𝑎𝑡𝑒𝑑 𝑐𝑒𝑙𝑙𝑠

𝑀 + 𝑁 − 1 = 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑎𝑙𝑙𝑜𝑐𝑎𝑡𝑒𝑑 𝑐𝑒𝑙𝑙𝑠

4+5-1=8

8=8

For allocated cells only 𝑈𝑖 + 𝑉𝑗 = 𝐶𝑖𝑗

𝑉1 = −1 𝑉2 = 2 𝑉3 = 3 𝑉4 = −4 𝑉5 = −2 Supply

𝑈1 = 0 10 2 3 15 9 35+𝜀
𝜀 35

𝑈2 = 6 5 10 15 2 4 40
20 10 10

𝑈3 = 3 15 5 14 7 15 20+𝜀
20 + 𝜀

𝑈4 20 15 13 25 8 30
= 10 5 25

Demand 20 20+2𝜀 40 10 35 125+2𝜀

For unallocated cells calculate the penalties 𝑃𝑖𝑗 = 𝑈𝑖 + 𝑉𝑗 − 𝐶𝑖𝑗 .

𝐶11 = −11, 𝐶14 = −19, 𝐶15 = −11, 𝐶22 = −2, 𝐶23 = −6, 𝐶31 = −13, 𝐶33 = −8, 𝐶34 = −8, 𝐶35
= −14, 𝐶41 = −11, 𝐶42 = −3, 𝐶44 = −19
Check the optimality condition all 𝑃𝑖𝑗 values should be equal or less than zero; 𝑃𝑖𝑗 ≤ 0.

We have reached optimality since all 𝑃𝑖𝑗 values are equal or less than zero.

Total optimal transport cost is 35 × 3 + 20 × 5 + 10 × 2 + 10 × 4 + 20 × 5 + 5 × 13 + 25 × 8 = 630.

ASSIGNMENT PROBLEM

The assignment problem is a special case of transportation problem in which the objective is to assign
‘m’ jobs or workers to ‘n’ machines such that the cost incurred is minimized.

There are two types of assignment problems

a) Balanced – the number of rows equal the number of columns

b) Unbalanced – the number of rows does not equal the number of columns.

Hungarian algorithm method solution to assignment problem.

Step I :- Create Zero elements in the cost matrix by subtract the smallest element in each row
column for the corresponding row and column.
Step II:- Drop the least number of horizontal and vertical lines so as to cover all zeros if the no of
there lines are ‘N’ i)
If N = n (n=order of the square matrix) then an optimum assignment has been obtained ii) If N is
less than n proceed to step III.
Step III :- determine the smallest cost cell from among the uncrossed cells subtract. This cost
from all the uncrossed cells and add the same to all those cells laying in the intersection of
horizontal and vertical lines.
Step IV:- repeat steps II and III until N=n
Step V:- examine the rows (column) successively until a row (column) with are zero is found
enclose the zero in a square (0) and cancel out (0) any other zeros laying in the column (row) of
the Matrix. Continue in this way until all the rim requirements are satisfied i.e N=n.
Step VI:- repeat step 5 successively one of the following arises. i) No unmarked zero is left ii) If
more then one unmarked zeros in one column or row.
In case i) the algorithm stops ii)Encircle one of the unmarked zeros arbitrary and mark a cross in
the cells of remaining zeroes in it’s row and column. Repeat the process until no unmarked zero
is left in the cost matrix.
Step VII) we now have exactly one encircled zero in each row and each column of the cost
matrix. The assignment schedule corresponding to there zeros is the optimum (maximal)
assignment

Solving balanced problem

Problem 1.
JOBS
1 2 3 4
PERSONS A 10 12 19 11
B 5 10 7 8
C 12 14 13 11
D 8 12 11 9

Row reduction
1 2 3 4
A 0 2 9 1
B 0 5 2 3
C 1 3 2 0
D 0 4 3 1

Column reduction

1 2 3 4
A 0 0 7 1
B 0 3 0 3
C 1 1 0 0
D 0 2 1 1

1 2 3 4
A 0 0 7 1
B 0 3 0 3
C 1 1 0 0
D 0 2 1 1
All the zeros are covered with vertical lines.
The allocated cells equal the order of the matrix. N=n; 4=4, therefore we have reached
optimality.
 Person job total
A 2 12
B 3 7
C 4 11
D 1 8
Total optimum 38
cost

Problem 2.
Solve the assignment problem using Hungarian method. The matrix entries represent the
processing time in hours.
Operators
jobs A B C D
1 5 3 2 8
2 7 9 2 6
3 6 4 5 7
4 5 7 7 8
Row reduction
A B C D
1 3 1 0 6
2 5 7 0 4
3 2 0 1 3
4 0 2 2 3
Column reduction

A B C D
1 3 1 0 3
2 5 7 0 1
3 2 0 1 0
4 0 2 2 0

A B C D
1 3 1 0 3
2 5 7 0 1
3 2 0 1 0
4 0 2 2 0
All the zeros are covered with lines
However number of allocated cells does not equal the order of the matrix N≠ 𝑛; 3 ≠ 4.
 A B C D
1 2 0 0 2
2 4 6 0 0
3 2 0 2 0
4 0 2 3 0

A B C D
1 2 0 0 2
2 4 6 0 0
3 1 0 2 0
4 0 2 3 0

All the zeros are covered with lines

The allocated cells equal the order of the matrix therefore we have reached optimality.
operator job Total
hours
A 4 5
B 1 3
C 2 2
D 3 7
Total optimum 17
hours

Unbalanced assignment problem

For unbalanced problem introduce dummy row or column appropriately with zero entries.
Problem 1.

MACHINES
JOBS 1 2 3 4
A 18 24 28 32
B 8 13 17 19
C 10 15 19 22

Introduce dummy row

MACHINES
JOBS 1 2 3 4
A 18 24 28 32
B 8 13 17 19
C 10 15 19 22
D 0 0 0 0
Row reduction
 1 2 3 4
A 0 6 10 14
B 0 5 9 11
C 0 5 9 12
D 0 0 0 0
Column reduction
1 2 3 4
A 0 6 10 14
B 0 5 9 11
C 0 5 9 12
D 0 0 0 0

1 2 3 4
A 0 6 10 14
B 0 5 9 11
C 0 5 9 12
D 0 0 0 0
All the zeros are covered but the number of allocated cells does not equal the order of the
matrix.
1 2 3 4
A 0 1 5 9
B 0 0 4 6
C 0 0 4 7
D 5 0 0 0

All the zeros covered but allocated cells do not equal the order of the matrix.

1 2 3 4
A 0 1 1 5
B 0 0 0 2
C 0 0 0 3
D 9 4 0 0

All the zeros are covered, the allocated cells equal the order of the matrix, optimality has been
attained.
 Jobs Machines Total
hours
A 1 18
B 2 13
C 3 19
D 4 0
Total optimum 50
cost

Maximization in assignment problem

Assignment problem applies to minimization problem, if given a maximization problem convert
it to minimization by subtracting all the other entries from the largest entry in the matrix.
Example
Find the assignment of workers to jobs that will result to maximum profit.
JOBS
WORKERS A B C D E
1 62 78 50 111 82
2 71 84 61 73 59
3 87 92 111 71 81
4 48 64 87 77 80

Its unbalanced problem, introduce dummy row with zero entries.

A B C D E
1 62 78 50 111 82
2 71 84 61 73 59
3 87 92 111 71 81
4 48 64 87 77 80
5 0 0 0 0 0
Convert the maximization problem to minimization by subtracting all the entries from the
largest entry in the matrix.

A B C D E
1 49 33 61 0 29
2 40 27 50 38 52
3 24 19 0 40 30
4 63 47 24 34 31
5 111 111 111 111 111
Row reduction
A B C D E
1 49 33 61 0 29
2 13 0 23 11 25
3 24 19 0 40 30
4 39 23 0 10 8
5 0 0 0 0 0

Column reduction
A B C D E
1 49 33 61 0 29
2 13 0 23 11 25
3 24 19 0 40 30
4 39 23 0 10 8
5 0 0 0 0 0

A B C D E
1 49 33 61 0 29
2 13 0 23 11 25
3 24 19 0 40 30
4 39 23 0 10 8
5 0 0 0 0 0

All zeros are covered however the allocated cells do not equal the order of the matrix.
A B C D E
1 41 33 61 0 21
2 5 0 23 11 17
3 16 19 0 40 22
4 31 23 0 10 0
5 0 8 8 8 0

All the zeros are covered with lines, allocated cells equal the order of the matrix hence
optimality has been attained.
Jobs Worker Total
hours
A 5 0
B 2 84
C 3 111
D 1 111
E 4 80
Total optimum 386
profit