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

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.

Saved in:
Bibliographic Details
Published inManagement science Vol. 19; no. 1; pp. 42 - 45
Main Authors Elmaghraby, S. E, Arisawa, S
Format Journal Article
LanguageEnglish
Published Hanover, MD., etc INFORMS 01.09.1972
Institute of Management Sciences
Institute for Operations Research and the Management Sciences
SeriesManagement Science
Subjects
Algorithms
Inequality
Linear programming
Linear transformations
Mathematical vectors
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ISSN:0025-1909
1526-5501
DOI:10.1287/mnsc.19.1.42