A Generalized Case in Assignment Problem With Lucas Numbers

Abstract

The paper is intended to investigate a generalized case in the Assignment Problem. It is constructed by allocating cost assignments as Lucas Numbers. Few cases are studied. Some results are identified. Optimum assignments in the three cases are derived. Various graphs of different polynomials are shown.