An \(\varepsilon\)-sensitivity analysis in the primal-dual interior point method
From MaRDI portal
Publication:1610185
DOI10.1016/S0377-2217(98)00117-9zbMath1009.90130MaRDI QIDQ1610185
Woo-je Kim, Chan-Kyoo Park, Soondal Park
Publication date: 18 August 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
90C46: Optimality conditions and duality in mathematical programming
90C31: Sensitivity, stability, parametric optimization
90C51: Interior-point methods
Related Items
POSITIVE SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING, ON THE PROPERTIES OF ∊-SENSITIVITY ANALYSIS FOR LINEAR PROGRAMMING, An \(\epsilon\)-sensitivity analysis for semidefinite programming, A STUDY ON SENSITIVITY ANALYSIS FOR CONVEX QUADRATIC PROGRAMS, Extreme points of well-posed polytopes
Cites Work
- Unnamed Item
- Interior path following primal-dual algorithms. I: Linear programming
- An optimal-basis identification technique for interior-point linear programming algorithms
- A geometric view of parametric linear programming
- Path-Following Methods for Linear Programming
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming