María Jesús Gisbert (Miguel Hernández University of Elche), María Josefa Cánovas (Miguel Hernández University of Elche), Juan Parra (Miguel Hernández University of Elche) and Fco. Javier Toledo (Miguel Hernández University of Elche).
Abstract. The present paper is devoted to the computation of the Lipschitz modulus of the optimal value function restricted to its domain in linear programming under different types of perturbations. In the first stage, we study separately perturbations of the right-hand side of the constraints and perturbations of the coefficients of the objective function. Secondly, we deal with canonical perturbations, i.e., right-hand side perturbations together with linear perturbations of the objective. We advance that an exact formula for the Lipschitz modulus in the context of right-hand side perturbations is provided, and lower and upper estimates for the corresponding moduli are also established in the other two perturbation frameworks. In both cases, the corresponding upper estimates are shown to provide the exact moduli when the nominal (original) optimal set is bounded. A key strategy here consists in taking advantage of the background on calmness in linear programming and providing the aimed Lipschitz modulus through the computation of a uniform calmness constant.
Keywords. Lipschitz modulus; Optimal value; Linear programming; Variational analysis; Calmness
Scientific articles
N. Allouch, Luis A. Guardiola, & A. Meca (2024). Measuring productivity in networks: A game-theoretic approach. Socio-Economic Planning Sciences, 91, 101783.
N. Allouch (University of Kent – School of Economics), Luis A. Guardiola (Departamento de Métodos Cuantitativos para la Economía y Empresa, Universidad de Murcia), Ana Meca (I.U. Centro de Investigación Operativa, Universidad Miguel Hernández de Elche) Abstract: Measuring individual productivity (or equivalently distributing the overall productivity) in a network structure of workers displaying peer effects has been [...]