Two simple proofs for analyticity of the central path in linear programming
- 1 February 2001
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 28 (1) , 9-19
- https://doi.org/10.1016/s0167-6377(00)00065-1
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Analytical properties of the central path at boundary point in linear programmingMathematical Programming, 1999
- On the analyticity properties of infeasible-interior-point paths for monotone linear complementarity problemsNumerische Mathematik, 1999
- Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticityMathematical Programming, 1998
- The analyticity of interior-point-paths at strictly complementary solutions of linear programsOptimization Methods and Software, 1998
- Limiting behavior of weighted central paths in linear programmingMathematical Programming, 1994
- Degeneracy in interior point methods for linear programming: a surveyAnnals of Operations Research, 1993
- Path-Following Methods for Linear ProgrammingSIAM Review, 1992
- Limiting behavior of the affine scaling continuous trajectories for linear programming problemsMathematical Programming, 1991
- On the convergence behavior of trajectories for linear programmingContemporary Mathematics, 1990
- An analogue of Moreau’s proximation theorem, with application to the nonlinear complementarity problemPacific Journal of Mathematics, 1980