Optimal solution to the Assignment Problem

Abstract

An assignment mix is a specific form of the transportation mix that has significant applications in the real world. The assignment mix arises from various situations for which we ought to decide the best route to dispense 'n' tasks to 'n' persons in a piecewise linear function. In the present paper, we lay out three different approaches for cracking the assignment mix perfectly. These approaches rely on an iterative cycle of pair-wise diagonal interchanges between the assigned and unassigned cells. This paper describes the application of an iterative cycle of pair-wise diagonal interchanges to elicit a feasible solution in which the best solution is guaranteed.