Comparative study of maximisation assignment model by existing method and newly proposed methods

One of the simplest uses of linear programming is known as the assignment problem, which is a special case of the transportation problem. The assignment problem manages the inquiry about to dole out n-items to m-different items in the most ideal way for production planning, telecommunication, VLSI design, economics, etc. Many researchers developed newly proposed methods for solving assignment problems and others modified the Hungarian method. Therefore, in the present study, an effort has been made to solve the real-life balance and unbalance type profit maximisation assignment problem used by ten newly proposed methods such as MAP, MSEI, ATOC, NAZs and six others methods, and compared results with Hungarian method. This study found that Method 8 takes the least time for computation of both type problems as compared with other methods. This paper advocates that new researchers and scientists may use the newly proposed Method 8 in place of the existing method.