Assignment problem (maximization): A new approach

Abstract

This paper introduces a novel and faster approach to finding the optimal feasible solution of assignment problem in maximization scenarios. The proposed method, termed ’Jha’s Method’ offers a more practical alternative over the long-known Hungarian method. It eliminates the need for the calculation of the opportunity loss matrix while maintaining computational efficiency. The Jha’s method, it’s optimality test, and its computer code using Python language are unique till now.