| written 9.6 years ago by | • modified 5.2 years ago |
Solve the following assignment problem (Profits in ‘000 Rs)
| Jobs | Machines | ||||
|---|---|---|---|---|---|
| M1 | M2 | M3 | M4 | M5 | |
| J1 | 12 | 14 | 13 | 14 | 15 |
| J2 | 14 | 13 | 12 | - | 17 |
| J3 | 18 | 16 | 15 | 13 | 17 |
| J4 | 10 | 10 | - | 16 | 12 |
| J5 | 16 | 15 | 14 | 22 | 13 |
| written 9.6 years ago by | • modified 5.2 years ago |
Solve the following assignment problem (Profits in ‘000 Rs)
| Jobs | Machines | ||||
|---|---|---|---|---|---|
| M1 | M2 | M3 | M4 | M5 | |
| J1 | 12 | 14 | 13 | 14 | 15 |
| J2 | 14 | 13 | 12 | - | 17 |
| J3 | 18 | 16 | 15 | 13 | 17 |
| J4 | 10 | 10 | - | 16 | 12 |
| J5 | 16 | 15 | 14 | 22 | 13 |
| written 9.6 years ago by |
The hyphens indicate that there is zero profit in those cells.
Converting the problem to a minimization problem, by considering the difference between the largest element in the whole matrix, and each other element:



Allocation can be made as shown. However, each row and column do not have one allocation. Drawing minimum number of lines through the zeroes:


Allocation can be made as shown. However, each row and column still do not have one allocation. Drawing minimum number of lines through the zeroes:


Every row and column has an allocation.
Making the same allocation in the original matrix:

Maximum profit = 18 + 10 + 13 + 22 + 17 = Rs. 80000