A Peculiar Case in Assignment Problem With Triangular Numbers

Abstract

In this Article, we focus on an assignment Problem which contains Triangular numbers. It is considered by taking cost assignments as Triangular numbers. Some observations are traced. By using Hungarian Method, the optimum Assignment is found in the positions (1,n),(2,n-1),(3,n-2),(4,n-3).(n-3,4),(n-2,3),(n-1,2),(n,1) in the minimization type. The positions are reversed in the maximization type. By using Bottle neck Method, (1,1),(2,2),(3,3),(4,4).(n.n) are positions of optimum assignment in minimization and maximization types.