An Iterative Method for Solving Linear Fraction Programming (LFP) Problem with Sensitivity Analysis
Department of Mathematics, Helwan University, (11795) Cairo, Egypt
Math. Comput. Appl. 2008, 13(3), 147-151; https://doi.org/10.3390/mca13030147
Published: 1 December 2008
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.
Keywords:
Linear fraction program; sensitivity analysis
Share and Cite
MDPI and ACS Style
Tantawy, S. An Iterative Method for Solving Linear Fraction Programming (LFP) Problem with Sensitivity Analysis. Math. Comput. Appl. 2008, 13, 147-151. https://doi.org/10.3390/mca13030147
AMA Style
Tantawy S. An Iterative Method for Solving Linear Fraction Programming (LFP) Problem with Sensitivity Analysis. Mathematical and Computational Applications. 2008; 13(3):147-151. https://doi.org/10.3390/mca13030147
Chicago/Turabian StyleTantawy, Said. 2008. "An Iterative Method for Solving Linear Fraction Programming (LFP) Problem with Sensitivity Analysis" Mathematical and Computational Applications 13, no. 3: 147-151. https://doi.org/10.3390/mca13030147
