Lipschitz Modulus of the Optimal Value in Linear Programming
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 perturbati...
| Autores: | , , , |
|---|---|
| Tipo de documento: | artigo |
| Data de publicação: | 2018 |
| País: | España |
| Recursos: | Universidad Miguel Hernández de Elche |
| Repositório: | REDIUMH. Depósito Digital de la UMH |
| OAI Identifier: | oai:dspace.umh.es:11000/34236 |
| Acesso em linha: | https://hdl.handle.net/11000/34236 |
| Access Level: | Acceso aberto |
| Palavra-chave: | Lipschitz modulus Optimal value Linear programming Variational analysis Calmness CDU::5 - Ciencias puras y naturales::51 - Matemáticas |
| Resumo: | 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. |
|---|