Efficient projective algorithm for linear fractional programming problem based on a linear programming formulation
by Bennani Ahlem; Benterki Djamel
International Journal of Computing Science and Mathematics (IJCSM), Vol. 16, No. 1, 2022

Abstract: In this paper, we are interested in solving a linear fractional programming (LFP) problem that is converted into an equivalent linear program. The obtained problem is solved through an interior point method. In the first step, an adequate formulation of LFP problem into an equivalent linear program was proposed by Bennani et al. (2021) avoiding the increase of the dimension of the initial problem. Moreover, we successfully established a comparative numerical implementation of Ye-Lustig's algorithm to find the optimal solution. A comparative numerical study is carried out between this formulation and another classical one. The results obtained were very encouraging and showed clearly the impact of this formulation.

Online publication date: Mon, 07-Nov-2022

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com