Ellipsoids containing optimal solutions of the linear programming problem
From MaRDI portal
Publication:5954380
zbMATH Open0983.90038MaRDI QIDQ5954380FDOQ5954380
Authors: I. Litvinchev
Publication date: 7 April 2002
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Recommendations
- On solution-containing ellipsoids in linear programming
- On improved Choi-Goldfarb solution-containing ellipsoids in linear programming
- Containing and shrinking ellipsoids in the path-following algorithm
- scientific article; zbMATH DE number 5585899
- Recovering Optimal Basic Variables in Karmarkar's Polynomial Algorithm for Linear Programming
Linear programming (90C05) Interior-point methods (90C51) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cited In (7)
- Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
- On improved Choi-Goldfarb solution-containing ellipsoids in linear programming
- Title not available (Why is that?)
- Embedded maximal ellipsoids and semi-infinite optimization
- Title not available (Why is that?)
This page was built for publication: Ellipsoids containing optimal solutions of the linear programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5954380)