An iterative method for solving linear fraction programming (LFP) problem with sensitivity analysis

Abstract

In this paper an iterative method for solving linear fraction programming (LFP) problem is proposed, it will be shown that this method can be used for sensitivity analysis when a scalar parameter is introduced in the objective function coefficients and our task of this sensitivity investigation is to maintain the optimality of the problem under consideration. A simple example is given to illustrate this proposed method.