A gravitational interior point method for LP.

DOI10.1007/BF03398711zbMath1158.90384OpenAlexW2773989772MaRDI QIDQ2476413

Katta G. Murty

Publication date: 19 March 2008

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03398711

zbMATH Keywords

interior point methodgravitational methodlinear programming (LP)

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)

Cites Work

• Unnamed Item
• Unnamed Item
• The steepest descent gravitational method for linear programming
• The gravitational method for linear programming
• A critical index algorithm for nearest point problems on simplicial cones
• A Nearest Point Algorithm for Convex Polyhedral Cones and Applications to Positive Linear Approximation.
• Finding the nearest point in A polytope
• Complexity of the gravitational method for linear programming

This page was built for publication: A gravitational interior point method for LP.