Ellipsoids containing optimal solutions of the linear programming problem
From MaRDI portal
The author constructs ellipsoids that contain optimal solutions of the primal and/or dual linear programming problem and do not depend on the method used to solve the original formulation. It is shown that many well-known interior-point methods realize descents toward the centers of ellipsoids. The constructed ellipsoids are used to formulate criteria for identifying the optimal basic and nonbasic variables.
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
Cited in
(9)- On solution-containing ellipsoids in linear programming
- On improved Choi-Goldfarb solution-containing ellipsoids in linear programming
- Embedded maximal ellipsoids and semi-infinite optimization
- scientific article; zbMATH DE number 4202018 (Why is no real title available?)
- scientific article; zbMATH DE number 4003907 (Why is no real title available?)
- scientific article; zbMATH DE number 4060993 (Why is no real title available?)
- Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm
- scientific article; zbMATH DE number 1971074 (Why is no real title available?)
- scientific article; zbMATH DE number 232497 (Why is no real title available?)
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)
