Assignment problem: Difference between revisions

Revision as of 04:54, 15 December 2005

Revision as of 08:41, 15 December 2005

Line 52:

Then we perform row operations on the matrix. To do this, the lowest of all ai [i belonging to 1-4] is taken and is subtracted from the other elements in that row. This will lead to at least one zero in that row [We get multiple zeros when there are two equal elements which also happen to be the lowest in that row]. This procedure is repeated for all rows. We now have a matrix with at least one zero per row. Now we try to assign tasks to agents such that each agent is doing only one task and the penalty incurred in each case is zero. This is illustrated below.

'''Note-IMatrix haventnotation usedhasnt thebeen matrix notationused since formatting is not possible with that'''