Project

A B C No. of Subcontractors > No. of Proj

Westside 50 36 16 Problem is Unbalanced
Subcontractor Federated 28 30 18 We need not do anything to make
Goliath 35 32 20
Universal 25 25 14

Min Distance 69

Project
A B C Total
Westside 0 0 1 1 <= 1
Subcontractor Federated 1 0 0 1 <= 1
Goliath 0 0 0 0 <= 1
Universal 0 1 0 1 <= 1
Total 1 1 1
= = =
1 1 1
No. of Subcontractors > No. of Projects Optimal Assignment
Problem is Unbalanced Subcontractor Project
We need not do anything to make the problem balanced Westside C
Federated A
Goliath Unassigned
Universal B

min Distance 69
 Job
1 2 3 4 5
A 25 18 32 20 21
Worker
B 34 25 21 12 17
C 20 17 20 32 16
D 20 28 20 16 27
Dummy 0 0 0 0 0

Min Cost 66

Job
1 2 3 4 5 Total
A 0 1 0 0 0 1 <=
Worker
B 0 0 0 1 0 1 <=
C 0 0 0 0 1 1 <=
D 0 0 1 0 0 1 <=
Dummy 1 0 0 0 0 1 <=
Total 1 1 1 1 1
= = = = =
1 1 1 1 1
N0. of Workers ≠ No. of Jobs Optimal Assignment
Unbalanced Problem Worker Job
So add 1 dummy worker with 0 cost A 2
B 4
C 5
D 3
Dummy 1

min Cost 66

1
1
1
1
1
 Client
1 2 3 No. of Project Leaders = No. of Clie
Jayaraj 10 16 32 Balanced Problem
Project Leader
Elango 14 22 40
Sidhu 22 24 34

Min Time 64

Client
1 2 3 Total
Jayaraj 0 1 0 1 <= 1
Project Leader
Elango 1 0 0 1 <= 1
Sidhu 0 0 1 1 <= 1
Total 1 1 1
= = =
1 1 1
No. of Project Leaders = No. of Clients Optimal Assignment
Balanced Problem Project Leader Client
Jayaraj 2
Elango 1
Sidhu 3

min time 64
 Client
1 2 3 No. of Project Leaders > No. of Clie
Jayaraj 10 16 32 Problem is Unbalanced
Project Leader
Elango 14 22 40 We need not do anything to make
Sidhu 22 24 34
Rajiv 14 18 36

Min Time 62

Client
1 2 3 Total
Jayaraj 1 0 0 1 <= 1
Project Leader
Elango 0 0 0 0 <= 1
Sidhu 0 0 1 1 <= 1
Rajiv 0 1 0 1 <= 1
Total 1 1 1
= = =
1 1 1
No. of Project Leaders > No. of Clients Optimal Assignment
Problem is Unbalanced Project Le Client
We need not do anything to make the problem balanced Jayaraj 1
Elango Unassigned
Sidhu 3
Rajiv 2

min time 62