DIVIDE ROW MINIMA AND SUBTRACT COLUMN MINIMA TECHNIQUE FOR SOLVING ASSIGNMENT PROBLEMS.

Assignment problems deal with the question how to assign n objects to m other objects in an injective fashion in the best possible way. An assignment problem is completely specified by its two components the assignments, which represent the underlying combinatorial structure, and the objective function to be optimized, which models \\\\\\\"the best possible way\\\\\\\". The assignment problem refers to another special class of linear programming problem where the objective is to assign a number of resources to an equal number of activities on a one to one basis so as to minimize total costs of performing the tasks at hand or maximize total profit of allocation. In this paper we introduce a new technique to solve assignment problems namely, Divide Row Minima and Subtract Column Minima .For the validity and comparison study we consider an example and solved by using our technique and the existing Hungarian (HA) and matrix ones assignment method(MOA) and compare optimum result shown graphically.