A new method for solving linear fractional programming problem with absolute value functions

Sapan Kumar Das, S.A. Edalatpanah and Tarni Mandal

International Journal of Operational Research, 2019, vol. 36, issue 4, 455-466

Abstract: In this paper, we propose a new model for linear fractional programming problem with absolute value functions. The major contribution of this paper is that transformation of linear fractional programming problem into separate linear programming problems with some theorems and then solution of these problems by popular algorithm. This work also used to simplex type algorithms to arrive at an optimal solution for a linear programming problem with absolute value. Moreover, we compare this method with an existing method. Numerical experiments are also given to illustrate the assertions.

Keywords: fractional programming; computing science; absolute value; simplex method. (search for similar items in EconPapers)
Date: 2019
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.inderscience.com/link.php?id=104051 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:36:y:2019:i:4:p:455-466

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().