Abstract
From a computational point of view, this paper provides a significant advance in the study of the calmness property of ordinary (finite) linear programs under canonical perturbations (i.e., perturbations of the objective function coefficient vector and the right-hand side of the constraint system). In the recent literature we find, for both the feasible and the optimal set (argmin) mappings, computable expressions for the corresponding calmness moduli. These expressions are called point-based as far as they only depend on the nominal data. In this paper we show that both calmness moduli are indeed (sharp) calmness constants, and provide point-based expressions for neighborhoods where such constants work. We show that our results cannot be extended to general convex inequality systems under right-hand side perturbations.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
