An -sensitivity analysis in the primal-dual interior point method

DOI10.1016/S0377-2217(98)00117-9MaRDI QIDQ1610185zbMATH OpenFDO

Authors 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)

zbMATH Keywords

sensitivity analysisinterior point method

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Interior-point methods (90C51) Sensitivity, stability, parametric optimization (90C31)

Recommendations

• ON THE PROPERTIES OF ∊-SENSITIVITY ANALYSIS FOR LINEAR PROGRAMMING
• An interior-point approach to sensitivity analysis in degenerate linear programs
• An \(\epsilon\)-sensitivity analysis for semidefinite programming
• Sensitivity analysis in linear programming and semidefinite programming using interior-point methods
• A STUDY ON SENSITIVITY ANALYSIS FOR CONVEX QUADRATIC PROGRAMS

Cites work

• scientific article; zbMATH DE number 439946 (Why is no real title available?)
• A geometric view of parametric linear programming
• An optimal-basis identification technique for interior-point linear programming algorithms
• Interior path following primal-dual algorithms. I: Linear programming
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• Path-Following Methods for Linear Programming

Cited in

(10)

• Lagrangian modelling of large deformation induced by progressive failure of sensitive clays with elastoviscoplasticity
• An Interior-Point Perspective on Sensitivity Analysis in Semidefinite Programming
• An interior boundary pivotal solution algorithm for linear programmes with the optimal solution-based sensitivity region
• Extreme points of well-posed polytopes
• POSITIVE SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING
• An \(\epsilon\)-sensitivity analysis for semidefinite programming
• A New Unblocking Technique to Warmstart Interior Point Methods Based on Sensitivity Analysis
• A general parametric analysis approach and its implication to sensitivity analysis in interior point methods
• ON THE PROPERTIES OF ∊-SENSITIVITY ANALYSIS FOR LINEAR PROGRAMMING
• A STUDY ON SENSITIVITY ANALYSIS FOR CONVEX QUADRATIC PROGRAMS

This page was built for publication: An \(\varepsilon\)-sensitivity analysis in the primal-dual interior point method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1610185)