Note on implementing the new sphere method for LP using matrix inversions sparingly

DOI10.1007/s11590-008-0098-1zbMath1155.90429OpenAlexW2020967989MaRDI QIDQ1001333

Katta G. Murty, Mohammad R. Oskoorouchi

Publication date: 17 February 2009

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-008-0098-1

zbMATH Keywords

linear programming (LP)ball center of a polytopeball center on the objective planedescent directionsinterior point methods (IPMs)solving lps without matrix inversions

Mathematics Subject Classification ID

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

Related Items (1)

Deepest point of a polyhedron and linear programming

Cites Work

• Interior path following primal-dual algorithms. I: Linear programming
• Components of efficiency evaluation in data envelopment analysis
• On the complexity of following the central path of linear programs by linear extrapolation. II
• On the Implementation of a Primal-Dual Interior Point Method
• Linear Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Note on implementing the new sphere method for LP using matrix inversions sparingly