Calmness modulus of fully perturbed linear programs

Abstract

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 full perturbations (perturbations of all coefficients), after characterizing the calmness property for the optimal set mapping, the paper provides an operative upper bound for the corresponding calmness modulus, as well as some illustrative examples. We provide