Pages that link to "Item:Q1113799"
From MaRDI portal
The following pages link to Determining basic variables of optimal solutions in Karmarkar's new LP algorithm (Q1113799):
Displaying 9 items.
- On the finite convergence of interior-point algorithms for linear programming (Q687096) (← links)
- Introduction: New approaches to linear programming (Q1088596) (← links)
- An optimal-basis identification technique for interior-point linear programming algorithms (Q1174842) (← links)
- Degeneracy in interior point methods for linear programming: A survey (Q1312753) (← links)
- On solution-containing ellipsoids in linear programming (Q1321453) (← links)
- On improved Choi-Goldfarb solution-containing ellipsoids in linear programming (Q1591595) (← links)
- Identifying an optimal basis in linear programming (Q1915926) (← links)
- Ellipsoids that contain all the solutions of a positive semi-definite linear complementarity problem (Q2276889) (← links)
- Recovering Optimal Basic Variables in Karmarkar's Polynomial Algorithm for Linear Programming (Q3491303) (← links)