On solution-containing ellipsoids in linear programming

DOI10.1007/BF02196599zbMath0797.90060OpenAlexW2010048675MaRDI QIDQ1321453

Donald Goldfarb, In-Chan Choi

Publication date: 25 October 1994

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

ellipsoidsinterior-point methodsoptimal basic and nonbasic variables

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (1)

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

Cites Work

• Unnamed Item
• A new polynomial-time algorithm for linear programming
• An \(O(n^ 3L)\) potential reduction algorithm for linear programming
• A ``build-down scheme for linear programming
• A polynomial-time algorithm, based on Newton's method, for linear programming
• Determining basic variables of optimal solutions in Karmarkar's new LP algorithm
• Interior path following primal-dual algorithms. I: Linear programming
• A polynomial-time algorithm for a class of linear complementarity problems
• Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
• Containing and shrinking ellipsoids in the path-following algorithm
• A variation on Karmarkar’s algorithm for solving linear programming problems
• Recovering Optimal Basic Variables in Karmarkar's Polynomial Algorithm for Linear Programming
• The Ellipsoid Method Generates Dual Variables
• Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm

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