On improved Choi-Goldfarb solution-containing ellipsoids in linear programming

DOI10.1016/S0167-6377(00)00026-2zbMath0997.90046WikidataQ127064087 ScholiaQ127064087MaRDI QIDQ1591595

Igor S. Litvinchev

Publication date: 20 December 2000

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

linear programminginterior point methodsChoi-Goldfarb ellipsoidsprimal-dual containing ellipsoidsolution-containing ellipsoids

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm
• A ``build-down scheme for linear programming
• Determining basic variables of optimal solutions in Karmarkar's new LP algorithm
• On solution-containing ellipsoids in linear programming
• Containing and shrinking ellipsoids in the path-following algorithm
• Recovering Optimal Basic Variables in Karmarkar's Polynomial Algorithm for Linear Programming
• Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm

This page was built for publication: On improved Choi-Goldfarb solution-containing ellipsoids in linear programming