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

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.