Critical objective size and calmness modulus in linear programming
DOI10.1007/S11228-015-0351-6zbMATH Open1355.90097OpenAlexW2197144437MaRDI QIDQ505622FDOQ505622
Authors: René Henrion, F. Javier Toledo, Maria J. Cánovas, Juan Parra 
Publication date: 26 January 2017
Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11228-015-0351-6
Recommendations
- Calmness modulus of fully perturbed linear programs
- Calmness of the optimal value in linear programming
- Calmness modulus of linear semi-infinite programs
- Point-based neighborhoods for sharp calmness constants in linear programming
- Outer limit of subdifferentials and calmness moduli in linear and nonlinear programming
Linear programming (90C05) Sensitivity, stability, parametric optimization (90C31) Set-valued and variational analysis (49J53) Sensitivity, stability, well-posedness (49K40)
Cites Work
- Variational Analysis
- Nonsmooth equations in optimization. Regularity, calculus, methods and applications
- Implicit Functions and Solution Mappings
- Some continuity properties of polyhedral multifunctions
- On the Calmness of a Class of Multifunctions
- Title not available (Why is that?)
- Error bounds for solutions of linear equations and inequalities
- Calmness modulus of linear semi-infinite programs
- Boundary of subdifferentials and calmness moduli in linear semi-infinite optimization
- Calmness of constraint systems with applications
- Outer limit of subdifferentials and calmness moduli in linear and nonlinear programming
- Calmness modulus of fully perturbed linear programs
- Stability of error bounds for convex constraint systems in Banach spaces
- First order and second order characterizations of metric subregularity and calmness of constraint set mappings
- A Characterization of Stability in Linear Programming
- Hoffman's Error Bound, Local Controllability, and Sensitivity Analysis
- Characterizations of error bounds for lower semicontinuous functions on metric spaces
- Calmness of the feasible set mapping for linear inequality systems
- Optimization methods and stability of inclusions in Banach spaces
- Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems
Cited In (7)
- Point-based neighborhoods for sharp calmness constants in linear programming
- Outer limit of subdifferentials and calmness moduli in linear and nonlinear programming
- Calmness modulus of fully perturbed linear programs
- A data-independent distance to infeasibility for linear conic systems
- Calmness of the optimal value in linear programming
- Recent contributions to linear semi-infinite optimization
- Recent contributions to linear semi-infinite optimization: an update
This page was built for publication: Critical objective size and calmness modulus in linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q505622)
