ON THE PROPERTIES OF ∊-SENSITIVITY ANALYSIS FOR LINEAR PROGRAMMING

DOI10.1142/S0217595905000467zbMath1078.90036OpenAlexW2155475309MaRDI QIDQ5315980

Chan-Kyoo Park, Woo-je Kim, Soondal Park

Publication date: 12 September 2005

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595905000467

zbMATH Keywords

sensitivity analysisinterior-point methodoptimal partitionLinear programming

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Interior-point methods (90C51)

Related Items

A STUDY ON SENSITIVITY ANALYSIS FOR CONVEX QUADRATIC PROGRAMS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence behavior of interior-point algorithms
• On scaled projections and pseudoinverses
• Interior path following primal-dual algorithms. I: Linear programming
• A geometric view of parametric linear programming
• Sensitivity analysis in linear programming: Just be careful!
• A primal-dual infeasible-interior-point algorithm for linear programming
• Finding an interior point in the optimal face of linear programs
• Recovering an optimal LP basis from an interior point solution
• The use of the optimal partition in a linear programming solution for postoptimal analysis
• An \(\varepsilon\)-sensitivity analysis in the primal-dual interior point method
• Numerical aspects in developing LP softwares, LPAKO and LPABO
• An Interior-Point Approach to Sensitivity Analysis in Degenerate Linear Programs
• On the Dimension of the Set of Rim Perturbations for Optimal Partition Invariance
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• POSITIVE SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING