A gravitational interior point method for LP.

DOI10.1007/BF03398711MaRDI QIDQ2476413zbMATH OpenOpenAlexFDO

Authors 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

gravitational methodinterior point methodlinear programming (LP)

Mathematics Subject Classification ID

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

Recommendations

• The gravitational method for linear programming
• A new practically efficient interior point method for LP
• The steepest descent gravitational method for linear programming
• scientific article; zbMATH DE number 980263
• Complexity of the gravitational method for linear programming

Cites work

• 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.
• Complexity of the gravitational method for linear programming
• Finding the nearest point in A polytope
• scientific article; zbMATH DE number 192986 (Why is no real title available?)
• scientific article; zbMATH DE number 3561096 (Why is no real title available?)
• The gravitational method for linear programming
• The steepest descent gravitational method for linear programming

Cited in

(5)

• The gravitational method for linear programming
• A new practically efficient interior point method for LP
• scientific article; zbMATH DE number 980263 (Why is no real title available?)
• The steepest descent gravitational method for linear programming
• Complexity of the gravitational method for linear programming

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2476413)