Revisiting assignment problem: A novel approach to optimality

Abstract

Known since decades, all pursue standard algorithm to arrive at optimal basic feasible solution of assignment problem. Retaining the prime objective of assignment, we like to share what our approaches are that initially searches for a basic feasible solution and attempts to rectify each allocation to its optimal value. We, strongly, are of the opinion that this novel approach possesses logical but faster proceedings to optimality: once on achieving basic feasible solution. We are of the opinion that this new approach, on the basis of its own merits, will be widely accepted in the academic world of the subject.