A computational comparison between algorithms for linear fractional programming

DOI10.1080/02522667.1992.10699120zbMath0773.90075OpenAlexW2057470690MaRDI QIDQ5286929

Andrea Ellero, Elena Moretti

Publication date: 25 October 1993

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1992.10699120

zbMATH Keywords

computational experienceunbounded feasible regionlinear fractional problemcomparison of the two algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Fractional programming (90C32) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• A Parametric Method for Solving the Linear Fractional Programming Problem
• An Extension of the Charnes-Cooper Method in Linear Fractional Programming
• Experiments with linear fractional problems
• Equivalence in linear fractional programming
• Programming with linear fractional functionals
• Hyperbolic programming

This page was built for publication: A computational comparison between algorithms for linear fractional programming