✨
AI Summary & Key Takeaways
AI Insight⚡ TL;DR(Too Long; Didn't Read)
A simple example is given to illustrate this proposed method.
📌 3 Key Takeaways
🎯
Objective & Hypothesis: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.
📊
Key Findings & Data: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.
💡
Conclusion & Impact:A simple example is given to illustrate this proposed method.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters
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.
🔖
Cite This Article
TANTAWY, S. (2008). An iterative method for solving linear fraction programming (LFP) problem with sensitivity analysis. Mathematical and Computational Applications, Cilt: 13 - Sayı: 3, 147–151. https://ajindex.com/articles/280062