On Algorithmic Equivalence in Linear Fractional Programming

DOI10.2307/2007510MaRDI QIDQ3927067zbMATH OpenOpenAlexFDO

Authors Bertram Mond

Publication date 1981

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

zbMATH Keywords

algorithmic equivalenceCharnes-Cooper methodcomparison of algorithmsIsbell-Marlow methodlinear fractional programmingMartos method

Mathematics Subject Classification ID

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

Cites work

• Algorithmic Equivalence in Linear Fractional Programming
• scientific article; zbMATH DE number 4079163 (Why is no real title available?)
• scientific article; zbMATH DE number 3197631 (Why is no real title available?)
• Hyperbolic programming
• Programming with linear fractional functionals

Cited in

(4)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3927067)