Athanasios Vasilopoulos

(St. John’s University, Jamaica, NY 11439, USA)

 

 

Abstract: The 2-dimensional assignment problem, which consists of assigning n objects to n (or m) opportunities in an optimal way, has long been viewed as a special case of the Linear Programming problem. But solving the Assignment problem as a Linear Programming problem is to use, perhaps, the most inefficient method possible. Many other methods are available for solving the 2-dimensional assignment problem more efficiently. This paper briefly discusses several of these methods and then ranks them according to their efficiency, where efficiency is measured by the number of operations needed by each method to complete the assignment.

 

 

Key words: assignments; available methods and comparisons; cost matrix; comparative study; complexity

and sparcity; optimal and efficient solutions

 

JEL codes: C02, C19, D79