Profit Maximizing Assignment Problems I Hungarian Method I Tick Rule I Unbalanced I Dummy Row | LPP
There may be a situation when the assignment problem calls for maximization of profit. Such a problem can be solved by converting the given maximization problem into a minimization problem by substracting all the elements of the given matrix from the highest element.