Optimality in an Assignment problem. (Oct 2006)
An Assignment problem is optimal when minimum number of lines required to cover all zeroes in the matrix are equal to size of the matrix. Size of the matrix means number of rows or number of columns.
E. g. Size can be 4 x 4 or 5 x 5.
Once optimality is detected then we can do allocations in the matrix. Allocations are done in the zero (0) values.
We test the optimality after doing Row minimization and Column minimization.
10 Comments