A build-up variant of the logarithmic barrier method for LP
- 30 September 1992
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 12 (3) , 181-186
- https://doi.org/10.1016/0167-6377(92)90104-b
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- A polynomial method of approximate centers for linear programmingMathematical Programming, 1992
- A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear ProgrammingSIAM Journal on Optimization, 1992
- A Potential Reduction Algorithm Allowing Column GenerationSIAM Journal on Optimization, 1992
- An O(n 3 L) potential reduction algorithm for linear programmingMathematical Programming, 1991
- A “build-down” scheme for linear programmingMathematical Programming, 1990
- Interior path following primal-dual algorithms. part I: Linear programmingMathematical Programming, 1989
- A polynomial-time algorithm, based on Newton's method, for linear programmingMathematical Programming, 1988
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984