A Class of Fractional Programming Problems

Y. Almogy and O. Levin
Additional contact information
Y. Almogy: Technion—Israel Institute of Technology, Haifa, Israel
O. Levin: Technion—Israel Institute of Technology, Haifa, Israel

Operations Research, 1971, vol. 19, issue 1, 57-67

Abstract: The paper deals with problems of maximizing a sum of linear or concave-convex fractional functions on closed and bounded polyhedral sets. It shows that, under certain assumptions, problems of this type can be transformed into equivalent ones of maximizing multiparameter linear or concave functions subject to additional feasibility constraints. The problems are transformed into those finding roots of monotone-decreasing convex functions. Where the objective function is separable, such a root is unique, and any local optimum is a global one, i.e., the objective function is quasi-concave. In problems involving separable linear fractional functions, under some additional assumptions, the parametric presentation results in a combinational property. Where the number of terms in the objective function is equal or less than three, this property leads to an efficient algorithm.

Date: 1971
References: Add references at CitEc
Citations: View citations in EconPapers (12)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.19.1.57 (application/pdf)

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:inm:oropre:v:19:y:1971:i:1:p:57-67

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().