Sensitivity analysis in linear semi-infinite programming: perturbing cost and right-hand-side coefficients

DOI10.1016/j.ejor.2005.06.075zbMath1121.90121OpenAlexW2041164905MaRDI QIDQ877589

N. E. Zubov

Publication date: 3 May 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.06.075

zbMATH Keywords

linear semi-infinite programmingvalue functionrobustness and sensitivity analysis

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Semi-infinite programming (90C34)

Related Items (14)

Optimality conditions in convex multiobjective SIP ⋮ Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs ⋮ On the sufficiency of finite support duals in semi-infinite linear programming ⋮ Calmness of the Optimal Value in Linear Programming ⋮ Recent contributions to linear semi-infinite optimization ⋮ Strong duality and dual pricing properties in semi-infinite linear programming: a non-Fourier-Motzkin elimination approach ⋮ On stable uniqueness in linear semi-infinite optimization ⋮ Recent contributions to linear semi-infinite optimization: an update ⋮ Strong duality and sensitivity analysis in semi-infinite linear programming ⋮ Semi-infinite optimization under convex function perturbations: Lipschitz stability ⋮ Error bounds for the inverse feasible set mapping in linear semi-infinite optimization via a sensitivity dual approach ⋮ Stability of semi-infinite vector optimization problems under functional perturbations ⋮ Pseudo-Lipschitz property of linear semi-infinite vector optimization problems ⋮ Sufficient conditions for pseudo-Lipschitz property in convex semi-infinite vector optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approaches to sensitivity analysis in linear programming
• A geometric view of parametric linear programming
• Sensitivity analysis in linear programming: Just be careful!
• The use of the optimal partition in a linear programming solution for postoptimal analysis
• A generic result in linear semi-infinite optimization
• Recent contributions to linear semi-infinite optimization
• A general parametric analysis approach and its implication to sensitivity analysis in interior point methods
• On the stability of linear systems with an exact constraint set
• Sensitivity analysis in linear optimization: invariant support set intervals
• Semi-Infinite Programming: Theory, Methods, and Applications
• Uniqueness of the saddle points for most of the lagrange functions of the linear semi-infinite optimization
• On the Dimension of the Set of Rim Perturbations for Optimal Partition Invariance
• Simultaneous Primal-Dual Right-Hand-Side Sensitivity Analysis from a Strictly Complementary Solution of a Linear Program
• Matrix Sensitivity Analysis from an Interior Solution of a Linear Program
• Parametric Objective Function (Part 1)
• Parametric Objective Function (Part 2)—Generalization
• Coefficient Perturbation of a Constrained Extremum

This page was built for publication: Sensitivity analysis in linear semi-infinite programming: perturbing cost and right-hand-side coefficients