Next Article in Journal
A Cubic B-Spline Collocation Method for the EW Equation
Previous Article in Journal
Mechanical Stability and Elastic Properties of Some FCC Metals: A Many- Body Potential Applications
Article Menu

Article Versions

Export Article

Mathematical and Computational Applications is published by MDPI from Volume 21 Issue 1 (2016). Articles in this Issue 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.
Open AccessArticle
Math. Comput. Appl. 2008, 13(3), 147-151; https://doi.org/10.3390/mca13030147

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
PDF [112 KB, uploaded 31 March 2016]

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 Linear fraction program; sensitivity analysis
This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).
SciFeed

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.

Show more citation formats Show less citations formats

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Math. Comput. Appl. EISSN 2297-8747 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top