Karmarkar's projective method for linear programming: a computational survey

DOI10.1080/0020739900210204zbMath0708.90053OpenAlexW2016446942MaRDI QIDQ3491310

Mahesh H. Dodani, A. J. G. Babu

Publication date: 1990

Published in: International Journal of Mathematical Education in Science and Technology (Search for Journal in Brave)

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

zbMATH Keywords

comparison of algorithmsprojective methodcomputational viewpointsurvey of interior methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Uses Software

• LSQR
• SPARSPAK
• symrcm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A monotonic projective algorithm for fractional linear programming
• A new polynomial-time algorithm for linear programming
• The ellipsoid method and its consequences in combinatorial optimization
• Extensions of Lemke's algorithm for the linear complementarity problem
• Numerical Methods for Large Sparse Linear Least Squares Problems
• An experimental approach to karmarkar’s projective method for linear programming
• Feature Article—The Ellipsoid Method: A Survey
• Some Distribution-Independent Results About the Asymptotic Order of the Average Number of Pivot Steps of the Simplex Method
• A class of methods for linear programming
• The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
• Computational Experience in Solving Linear Programs

This page was built for publication: Karmarkar's projective method for linear programming: a computational survey