On lower bound updates in primal potential reduction methods for linear programming
From MaRDI portal
Publication:1181907
DOI10.1007/BF01582898zbMath0754.90034MaRDI QIDQ1181907
Publication date: 27 June 1992
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Les effets de l'exposant de la fonction barrière multiplicative dans les méthodes de points intérieurs, Updating lower bounds when using Karmarkar's projective algorithm for linear programming
Cites Work
- Unnamed Item
- A monotonic projective algorithm for fractional linear programming
- A new polynomial-time algorithm for linear programming
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- An extension of Karmarkar's algorithm for linear programming using dual variables
- A polynomial Newton method for linear programming
- Conical projection algorithms for linear programming
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
- Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
- Long steps in an \(O(n^ 3L)\) algorithm for linear programming
- Polynomial affine algorithms for linear programming
- Search directions for interior linear-programming methods
- A Centered Projective Algorithm for Linear Programming
- Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming
- An $O(\sqrt{n} L)$-Iteration Large-Step Primal-Dual Affine Algorithm for Linear Programming
