Multiobjective integer nonlinear fractional programming problem: A cutting plane approach

Abstract

The present paper discusses a multiobjective integer nonlinear fractional programming problem based on cutting plane technique. The methodology discussed is such that it finds all the nondominated t-tuples of the multiobjective nonlinear fractional programming problem by exploiting the quasimonotone character of the nonlinear fractional functions involved. The cut discussed in the present paper scans and truncates a portion of the feasible region in such way that once truncated, it does not reappear, thereby leading to the convergence of the proposed algorithm in finite number of steps. Further, the quasimonotone character of the objective functions involved enables us to find all the nondominated t-tuples at extreme points of the truncated feasible region obtained after repeated applications of the cut developed in the paper.