On Hyperbolic Programming with a Single Constraint and Upper-Bounded Variables

S. E. Elmaghraby and S. Arisawa
Additional contact information
S. E. Elmaghraby: North Carolina State University
S. Arisawa: North Carolina State University

Management Science, 1972, vol. 19, issue 1, 42-45

Abstract: The hyperbolic (or fractional) linear programming problem with only one aggregate constraint is solved by a simple and extremely efficient algorithm. The core step in the iterative procedure is the optimization of a linear function subject to a single linear constraint.

Date: 1972
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.19.1.42 (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:ormnsc:v:19:y:1972:i:1:p:42-45

Access Statistics for this article

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