Abstract
We consider convex stochastic optimization problems with probabilistic constraints which are defined by so-called r-concave probability measures. Since the true measure is unknown in general, the problem is usually solved on the basis of estimated approximations, hence the issue of perturbation analysis arises in a natural way. For the solution set mapping and for the optimal value function, stability results are derived. In order to include the important class of empirical estimators, the perturbations are allowed to be arbitrary in the space of probability measures (in contrast to the convexity property of the original measure). All assumptions relate to the original problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Artstein, Z. (1994) Sensitivity with respect to the underlying information in stochastic programs. Journal of Computational and Applied Mathematics 56, 127–136
Bank, B., Guddat, J., Klatte, D., Kummer, B., Tammer, K. (1982) Nonlinear Parametric Optimization. Akademie-Verlag, Berlin
Borell, C. (1975) Convex set functions in d-space. Periodica Mathematica Hungarica 6, 111–136
DupacovĂ¡, J. (1990) Stability and Sensitivity Analysis for Stochastic Programming. Annals of Operations Research 27, 115–142
Elstrodt, J. (1996) MaĂŸ-und Integrationstheorie. Springer, Berlin
Gröwe, N. (1997) Estimated stochastic programs with chance constraints. European Journal of Operational Research 101, 285–305
Henrion, R., Römisch, W. (1999) Metric regularity and quantitative stability in stochastic programs with probabilistic constraints. Mathematical Programming 84, 55–88
Henrion, R., Römisch, W. (1998) Stability of solutions to chance constrained stochastic programs. Preprint No. 397, Weierstrass Institute Berlin
Henrion, R. (1998) Qualitative Stability of Convex Programs with Probabilistic Constraints. Preprint No. 460, Weierstrass Institute Berlin
KankovĂ¡, V. (1997) On the Stability in Stochastic Programming: The Case of Individual Probability Constraints. Kybernetika 33, 525–546
Klatte, D. (1987) A note on quantitative stability results in nonlinear optimization. In: Lommatzsch K. (Ed.) Proceedings of the 19. Jahrestagung Mathematische Optimierung, Seminarbericht No. 90, Humboldt University Berlin, Department of Mathematics, 77–86
Prékopa, A. (1995) Stochastic Programming. Kluwer, Dordrecht
Rockafellar, R.T. (1970) Convex Analysis. Princeton University Press, Princeton
Römisch, W., Schultz, R. (1991) Stability analysis for stochastic programs. Annals of Operations Research 30, 241–266
Römisch, W., Schultz, R. (1991) Distribution sensitivity in stochastic programming. Mathematical Programming 50, 197–226
Wets, R.J.-B. (1989) Stochastic programming. In: Nemhauser G.L., Rinnoy Kan A.H.G., Todd M.J. (Eds.) Handbooks in operations research and management science, Volume 1: Optimization, North-Holland, 573–629
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Henrion, R. (2000). Qualitative Stability of Convex Programs with Probabilistic Constraints. In: Nguyen, V.H., Strodiot, JJ., Tossings, P. (eds) Optimization. Lecture Notes in Economics and Mathematical Systems, vol 481. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-57014-8_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-57014-8_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66905-0
Online ISBN: 978-3-642-57014-8
eBook Packages: Springer Book Archive