Programming with linear fractional functionals

Stanley Zionts

Naval Research Logistics Quarterly, 1968, vol. 15, issue 3, 449-451

Abstract: Charnes and Cooper [1] showed that a linear programming problem with a linear fractional objective function could be solved by solving at most two ordinary linear programming problems. In addition, they showed that where it is known a priori that the denominator of the objective function has a unique sign in the feasible region, only one problem need be solved. In the present note it is shown that if a finite solution to the problem exists, only one linear programming problem must be solved. This is because the denominator cannot have two different signs in the feasible region, except in ways which are not of practical importance.

Date: 1968
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
https://doi.org/10.1002/nav.3800150308

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:wly:navlog:v:15:y:1968:i:3:p:449-451

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().