Sensitivity analysis in linear semi-infinite programming: perturbing cost and right-hand-side coefficients
From MaRDI portal
Publication:877589
DOI10.1016/J.EJOR.2005.06.075zbMATH Open1121.90121OpenAlexW2041164905MaRDI QIDQ877589FDOQ877589
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
Linear programming (90C05) Sensitivity, stability, parametric optimization (90C31) Semi-infinite programming (90C34)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approaches to sensitivity analysis in linear programming
- The use of the optimal partition in a linear programming solution for postoptimal analysis
- Semi-Infinite Programming: Theory, Methods, and Applications
- Formulae for the sensitivity analysis of linear programming problems
- Parametric Objective Function (Part 1)
- Recent contributions to linear semi-infinite optimization
- Parametric Objective Function (Part 2)—Generalization
- A generic result in linear semi-infinite optimization
- A geometric view of parametric linear programming
- A general parametric analysis approach and its implication to sensitivity analysis in interior point methods
- Sensitivity analysis in linear optimization: invariant support set intervals
- Sensitivity analysis in linear programming: Just be careful!
- Simultaneous Primal-Dual Right-Hand-Side Sensitivity Analysis from a Strictly Complementary Solution of a Linear Program
- On the stability of linear systems with an exact constraint set
- 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
- Matrix Sensitivity Analysis from an Interior Solution of a Linear Program
- Coefficient Perturbation of a Constrained Extremum
Cited In (15)
- Semi-infinite optimization under convex function perturbations: Lipschitz stability
- 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
- Calmness of the Optimal Value in Linear Programming
- On stable uniqueness in linear semi-infinite optimization
- Error bounds for the inverse feasible set mapping in linear semi-infinite optimization via a sensitivity dual approach
- On the sufficiency of finite support duals in semi-infinite linear programming
- Recent contributions to linear semi-infinite optimization
- Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs
- Strong duality and dual pricing properties in semi-infinite linear programming: a non-Fourier-Motzkin elimination approach
- Strong duality and sensitivity analysis in semi-infinite linear programming
- Optimality conditions in convex multiobjective SIP
- Formulae for the sensitivity analysis of linear programming problems
- Recent contributions to linear semi-infinite optimization: an update
Recommendations
- Sensitivity Analysis in Linear Semi-Infinite Programming via Partitions 👍 👎
- Formulae for the sensitivity analysis of linear programming problems 👍 👎
- Post-Optimal Analysis in Linear Semi-Infinite Optimization 👍 👎
- Post-Optimal Analysis of Linear Semi-Infinite Programs 👍 👎
- Some differential estimates in linear programming 👍 👎
This page was built for publication: Sensitivity analysis in linear semi-infinite programming: perturbing cost and right-hand-side coefficients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877589)
