On Algorithmic Equivalence in Linear Fractional Programming

DOI10.2307/2007510zbMath0472.90065OpenAlexW4249453677MaRDI QIDQ3927067

Bertram Mond

Publication date: 1981

Full work available at URL: https://doi.org/10.2307/2007510

zbMATH Keywords

linear fractional programmingcomparison of algorithmsalgorithmic equivalenceCharnes-Cooper methodIsbell-Marlow methodMartos method

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Fractional programming (90C32) Linear programming (90C05)

Related Items (4)

The finite criss-cross method for hyperbolic programming ⋮ A complete algorithm for linear fractional programs ⋮ Extensions of Dinkelbach's algorithm for solving nonlinear fractional programming problems ⋮ Bibliography in fractional programming

Cites Work

• Unnamed Item
• Unnamed Item
• Programming with linear fractional functionals
• Hyperbolic programming
• Algorithmic Equivalence in Linear Fractional Programming

This page was built for publication: On Algorithmic Equivalence in Linear Fractional Programming