Complexity of the gravitational method for linear programming

DOI10.1023/A:1017591509792zbMath1016.90024OpenAlexW236210359MaRDI QIDQ5942223

No author found.

Publication date: 28 August 2001

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1017591509792

zbMATH Keywords

complexitysimplex methodlinear programworst-case analysisgravitational method

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05)

Related Items

A new vector field method for eigen-decomposition of symmetric matrices ⋮ A gravitational interior point method for LP.

Uses Software

• DEVEX

Cites Work

• The steepest descent gravitational method for linear programming
• Worst case behavior of the steepest edge simplex method
• The gravitational method for linear programming
• The Efficiency of the Simplex Method: A Survey
• A quasi-polynomial bound for the diameter\\of graphs of polyhedra
• The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item