Linear Programming with a Fractional Objective Function

G. R. Bitran and A. G. Novaes
Additional contact information
G. R. Bitran: University of São Paulo, São Paulo, Brazil
A. G. Novaes: University of São Paulo, São Paulo, Brazil

Operations Research, 1973, vol. 21, issue 1, 22-29

Abstract: This paper presents an algorithm, based on the simplex routine, that provides a way to solve a problem in which the objective function is not linear, but rather is represented by a ratio of two linear functions. This algorithm has a computational advantage over two previous ones because it requires neither variable transformations nor the introduction of new variables and constraints.

Date: 1973
References: Add references at CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.21.1.22 (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:21:y:1973:i:1:p:22-29

Access Statistics for this article

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