A note on a potential reduction algorithm for LP with simultaneous primal-dual updating
- 31 December 1991
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 10 (9) , 501-507
- https://doi.org/10.1016/0167-6377(91)90068-z
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- An $$O(\sqrt n L)$$ iteration potential reduction algorithm for linear complementarity problemsMathematical Programming, 1991
- An O(n 3 L) potential reduction algorithm for linear programmingMathematical Programming, 1991
- A Centered Projective Algorithm for Linear ProgrammingMathematics of Operations Research, 1990
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series ExtensionMathematics of Operations Research, 1990
- Interior path following primal-dual algorithms. part I: Linear programmingMathematical Programming, 1989
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984