This paper provides operative point-based formulas (only involving the nominal data, and not data in a neighborhood) for computing or estimating the calmness modulus of the optimal set (argmin) mapping in linear optimization under uniqueness of nominal optimal solutions. Our analysis is developed in two different parametric settings. First, in the framework of canonical perturbations (i.e., perturbations of the objective function and the right-hand-side of the constraints), the paper provides a computationally tractable formula for the calmness modulus, which goes beyond some preliminary results of the literature. Second, in the framework of perturbations of all coefficients, the paper provides a characterization of the calmness property for the optimal set mapping, as well as an operative upper bound for the corresponding calmness modulus. Illustrative examples are provided.
Authors 1,3,4: Center of Operations Research, Miguel Hernández University of Elche, 03202 Elche --- Author 2: Departamento de Ingeniería Matemática, Centro de Modelamiento Matemático(CMM), Universidad de Chile, Santiago, Chile --- Date: June, 2014
View Calmness of linear programs under perturbations of all data: characterization and modulus