Mathematical and Computational Applications is published by MDPI from Volume 21 Issue 1 (2016).
Articles in this Volume were published by another publisher in Open Access under a CC-BY (or CC-BY-NC-ND) licence.
Articles are hosted by MDPI on mdpi.com as a courtesy and upon agreement with the previous journal publisher.
An Iterative Method for Solving Linear Fraction Programming (LFP) Problem with Sensitivity Analysis
Department of Mathematics, Helwan University, (11795) Cairo, Egypt
Published: 1 December 2008
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.
This is an open access article distributed under the Creative Commons Attribution License
(CC BY 3.0).
Scifeed alert for new publications
Never miss any articles
matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
Define your Scifeed now
Share & Cite This Article
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.
Tantawy S. An Iterative Method for Solving Linear Fraction Programming (LFP) Problem with Sensitivity Analysis. Mathematical and Computational Applications. 2008; 13(3):147-151.
Tantawy, Said. 2008. "An Iterative Method for Solving Linear Fraction Programming (LFP) Problem with Sensitivity Analysis." Math. Comput. Appl. 13, no. 3: 147-151.
Show more citation formats
Show less citations formats
[Return to top]
Multiple requests from the same IP address are counted as one view.