Algorithmic Equivalence in Linear Fractional Programming

DOI10.1287/MNSC.14.5.301MaRDI QIDQ5532895zbMATH OpenOpenAlexFDO

Authors Harvey M. Wagner, John Yuan

Publication date 1968

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.14.5.301

zbMATH Keywords

operations research

Cited in

(16)

• The finite criss-cross method for hyperbolic programming
• A new method for solving fuzzy linear fractional programming problems
• Fractional programming
• Solving LFP by converting it into a single LP
• A complete algorithm for linear fractional programs
• Fractional programming
• On Algorithmic Equivalence in Linear Fractional Programming
• Bibliography in fractional programming
• Derman's book as inspiration: some results on LP for MDPs
• Fractional programming: Applications and algorithms
• Equivalence of various linearization algorithms for linear fractional programming
• Equivalence in linear fractional programming
• Experiments with linear fractional problems
• On Martos' and Chaehes-Coopeb's approach vis-a-vis
• Parametric linear fractional programming for an unbounded feasible region
• Efficient algorithms for solving nonlinear fractional programming problems

This page was built for publication: 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 Q5532895)