An Exclusive Case in Assignment Problem With Fibonacci Numbers

Abstract

The purpose of this paper is to find out an optimum Assignment for an exclusive in assignment problem. It is framed by taking Fibonacci numbers as cost assignment values with various sizes. In this study, the generalized optimum assignment for nxn size is successfully derived by using Hungarian method and Bottle neck method. The variations among the polynomials in different cases are also established.