Identifying an optimal basis in linear programming
From MaRDI portal
Publication:1915926
DOI10.1007/BF02206830zbMath0848.90094OpenAlexW2088937594MaRDI QIDQ1915926
Publication date: 1 July 1996
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02206830
Related Items
A note on properties of condition numbers, Towards an efficient augmented Lagrangian method for convex quadratic programming, Improved complexity results on solving real-number linear feasibility problems
Cites Work
- An active-set strategy in an interior point method for linear programming
- Convergence behavior of interior-point algorithms
- A new polynomial-time algorithm for linear programming
- On bounds for scaled projections and pseudoinverses
- A polynomial-time algorithm, based on Newton's method, for linear programming
- On scaled projections and pseudoinverses
- An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem
- The Nonlinear Geometry of Linear Programming. III Projective Legendre Transform Coordinates and Hilbert Geometry
- The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
- The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories
- A Short-Cut Potential Reduction Algorithm for Linear Programming
- A Dantzig-Wolfe-Like Variant of Karmarkar's Interior-Point Linear Programming Algorithm
- Unnamed Item