Bicriteria integer nonlinear fractional programming problem

This paper studies a bicriteria integer nonlinear fractional programming problem. An integer nonlinear fractional programming problem with one of the objective functions as the principal objective is considered. An integer linear fractional programming problem related to this is constructed. By varying the minimum acceptable values of the second level objective a sequence of the constrained integer nonlinear fractional programming problems is solved to generate the exhaustive set of efficient solutions. Ranking of integer solutions of the linear fractional programming problem helps in finding the optimal integer solutions of the sequence of constrained nonlinear fractional programming problems.