A new practically efficient interior point method for LP

MaRDI QIDQ3415351zbMATH OpenFDO

Authors Katta G. Murty

Publication date 18 January 2007

Full work available at URL http://journals.hil.unb.ca/index.php/AOR/article/view/93

Mathematics Subject Classification ID

Linear programming (90C05) Sensitivity, stability, parametric optimization (90C31)

Recommendations

• A gravitational interior point method for LP.
• The gravitational method for linear programming
• The steepest descent gravitational method for linear programming
• Complexity of the gravitational method for linear programming
• A new polynomial-time algorithm for linear programming

Cited in

(10)

• Note on implementing the new sphere method for LP using matrix inversions sparingly
• A problem in enumerating extreme points, and an efficient algorithm for one class of polytopes
• The gravitational method for linear programming
• A boundary-point LP solution method and its application to dense linear programs
• A gravitational interior point method for LP.
• Some results on centers of polytopes
• An active index algorithm for the nearest point problem in a polyhedral cone
• The steepest descent gravitational method for linear programming
• Complexity of the gravitational method for linear programming
• The nearest point problem in a polyhedral set and its extensions

This page was built for publication: A new practically efficient interior point method for LP

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