On relations between chance constrained and penalty function problems under discrete distributions. (English) Zbl 1284.90044

The author extends the theory of penalty functions to stochastic programming problems with nonlinear inequality constraints dependent on a random vector with a known distribution. Firstly, he proposes the formulations of the chance constrained and penalty function problems and derives the asymptotic equivalence of the two problems under finite discrete distributions with general known probabilities. Bounds on optimal values and the convergence of the optimal solutions are proposed. Finally, the author applies exact penalization under a modified calmness property in order to improve the results.


90C15 Stochastic programming
Full Text: DOI


[1] Bazaraa MS, Sherali HD, Shetty CM (2006) Nonlinear programming: theory and algorithms, 3rd edn. Wiley, Singapore · Zbl 1140.90040
[2] Branda M (2010) Solving real-life portfolio problem using stochastic programming and Monte-Carlo techniques. In: Houda M, Friebelová J (eds) Proceedings of the 28th international conference on mathematical methods in economics 2010. University of South Bohemia, České Budějovice, pp 67-72 · Zbl 0211.22601
[3] Branda M (2012a) Chance constrained problems: penalty reformulation and performance of sample approximation technique. Kybernetika 48(1):105-122 · Zbl 1243.93117
[4] Branda M (2012b) Sample approximation technique for mixed-integer stochastic programming problems with several chance constraints. Oper Res Lett 40(3):207-211 · Zbl 1245.90073
[5] Branda M (2012c) Stochastic programming problems with generalized integrated chance constraints. Optim J Math Program Oper Res 61(3):949-968 · Zbl 1252.90056
[6] Branda, M; Dupačová, J, Approximations and contamination bounds for probabilistic programs, Ann Oper Res, 193, 3-19, (2012) · Zbl 1254.90133
[7] Burke JV (1991a) Calmness and exact penalization. SIAM J Control Optim 29:493-497 · Zbl 0734.90090
[8] Burke JV (1991b) An exact penalization viewpoint of constrained optimization. SIAM J Control Optim 29:968-998 · Zbl 0737.90060
[9] D’Ambrosio, C; Lodi, A, Mixed integer nonlinear programming tools: a practical overview, 4OR Q J Oper Res, 9, 329-349, (2011) · Zbl 1235.90101
[10] Clarke FH (1983) Optimization and nonsmooth analysis. Wiley, New York · Zbl 0582.49001
[11] Dupačová, J; Gaivoronski, A; Kos, Z; Szantai, T, Stochastic programming in water management: a case study and a comparison of solution techniques, Eur J Oper Res, 52, 28-44, (1991) · Zbl 0726.90048
[12] Ermoliev, YM; Ermolieva, TY; Macdonald, GJ; Norkin, VI, Stochastic optimization of insurance portfolios for managing exposure to catastrophic risks, Ann Oper Res, 99, 207-225, (2000) · Zbl 0990.90084
[13] Klein Haneveld WK (1986) Duality in stochastic linear and dynamic programming. Lecture notes in economics and mathematical systems, vol 274. Springer, New York
[14] Klein Haneveld, WK; Vlerk, M, Integrated chance constraints: reduced forms and an algorithm, Comput Manag Sci, 3, 245-269, (2006) · Zbl 1136.90424
[15] Hoheisel, T; Kanzowa, Ch; Outrata, JV, Exact penalty results for mathematical programs with vanishing constraints, Nonlinear Anal, 72, 2514-2526, (2010) · Zbl 1185.90187
[16] Koch, T; Ralphs, T; Shinano, Y, Could we use a million cores to solve an integer program?, Math Methods Oper Res, 76, 67-93, (2012) · Zbl 1262.90106
[17] Luedtke, J; Ahmed, S, A sample approximation approach for optimization with probabilistic constraints, SIAM J Optim, 19, 674-699, (2008) · Zbl 1177.90301
[18] Nocedal J, Wright SJ (2006) Numerical optimization, 2nd edn. Springer, New York · Zbl 1104.65059
[19] Meskarian, R; Xu, H; Fliege, J, Numerical methods for stochastic programs with second order dominance constraints with applications to portfolio optimization, Eur J Oper Res, 216, 376-385, (2012) · Zbl 1242.90146
[20] Prékopa A (1995) Stochastic programming. Kluwer Dordrecht and Académiai Kiad, Budapest · Zbl 0834.90098
[21] Prékopa A (2003) Probabilistic programming. In: Ruszczynski A, Shapiro A (eds) Stochastic programming handbook in operations research and management science, vol 10. Elsevier, Amsterdam, pp 483-554 · Zbl 1273.91459
[22] Raike, WM, Dissection methods for solutions in chance constrained programming problems under discrete distributions, Manag Sci, 16, 708-715, (1970) · Zbl 0211.22601
[23] Rockafellar RT, Wets R (2004) Variational analysis, 2nd edn. Springer, Berlin
[24] Shapiro A (2003) Monte Carlo sampling methods. In: Ruszczynski A, Shapiro A (eds) Stochastic programming, handbook in operations research and management science, vol 10. Elsevier, Amsterdam, pp 483-554
[25] Xu, H; Zhang, D, Monte Carlo methods for Mean-risk optimization and portfolio selection, Comput Manag Sci, 9, 3-29, (2012) · Zbl 1273.91459
[26] Wang, W; Ahmed, S, Sample average approximation of expected value constrained stochastic programs, Oper Res Lett, 36, 515-519, (2008) · Zbl 1210.90131
[27] Žampachová E, Mrázek M (2010) Stochastic optimization in beam design and its reliability check. In: MENDEL 2010—16th international conference on soft computing. Mendel Journal series. Brno, FME BUT, pp 405-410
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.