ON ONE TO ONE CORRESPONDENCE MAPPING AND ITS APPLICATION TO LINEAR ASSIGNMENT PROBLEM

One to one correspondence can be referred to as a relation between the elements of two sets, where every element of one set is paired with exactly one element of the other set, and every element of the other set is paired with exactly one element of the first set. There are no unpaired elements. In the same way, Assignment problem deal with assigning n items/activities/tasks etc to n machines/workers/contractors etc in the best way so that no one activity gets more than one machine/worker and no one worker get more than one activity assigned to it. In this paper one to one correspondence is examined with its applications to linear Assignment problem. A one to one correspondence algorithm for solving linear assignment problem is presented. Finally numerical problems were solved for both minimization and maximization assignment problems for further understanding, and it was observed that the optimal solution is obtained faster and easier than the existing methods.