Mathematical Programming

, Volume 157, Issue 1, pp 153–189 | Cite as

Chance-constrained problems and rare events: an importance sampling approach

  • Javiera Barrera
  • Tito Homem-de-Mello
  • Eduardo Moreno
  • Bernardo K. Pagnoncelli
  • Gianpiero Canessa
Full Length Paper Series B


We study chance-constrained problems in which the constraints involve the probability of a rare event. We discuss the relevance of such problems and show that the existing sampling-based algorithms cannot be applied directly in this case, since they require an impractical number of samples to yield reasonable solutions. We argue that importance sampling (IS) techniques, combined with a Sample Average Approximation (SAA) approach, can be effectively used in such situations, provided that variance can be reduced uniformly with respect to the decision variables. We give sufficient conditions to obtain such uniform variance reduction, and prove asymptotic convergence of the combined SAA-IS approach. As it often happens with IS techniques, the practical performance of the proposed approach relies on exploiting the structure of the problem under study; in our case, we work with a telecommunications problem with Bernoulli input distributions, and show how variance can be reduced uniformly over a suitable approximation of the feasibility set by choosing proper parameters for the IS distributions. Although some of the results are specific to this problem, we are able to draw general insights that can be useful for other classes of problems. We present numerical results to illustrate our findings.


Chance-constrained programming Sample average approximation Importance sampling Rare-event simulation 

Mathematics Subject Classification

90C15 (Mathematical Programming/Stochastic programming) 65C05 (Numerical Analysis/Probabilistic Methods/Monte Carlo methods) 68M10 (Computer Science/Network design and communication) 



Authors acknowledge the financial support of Grant Anillo ACT-88, Basal Center CMM-UCh, CIRIC-INRIA Chile (J.B., E.M., G.C.), Programa Iniciativa Cientifica Milenio NC130062 (J.B) and FONDECYT Grants 1120244 (T.H., B.P.) and 1130681 (E.M.).


  1. 1.
    Adas, A.: Traffic models in broadband networks. IEEE Commun. Mag. 35(7), 82–89 (1997)CrossRefGoogle Scholar
  2. 2.
    Andrieu, L., Henrion, R., Römisch, W.: A model for dynamic chance constraints in hydro power reservoir management. Eur. J. Oper. Res. 207(2), 579–589 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Artstein, Z., Wets, R.J.B.: Consistency of minimizers and the SLLN for stochastic programs. J. Convex Anal. 2(1–2), 1–17 (1996)MathSciNetzbMATHGoogle Scholar
  4. 4.
    Asmussen, S., Glynn, P.: Stochastic Simulation. Springer, New York (2007)zbMATHGoogle Scholar
  5. 5.
    Beraldi, P., Ruszczyński, A.: The probabilistic set-covering problem. Oper. Res. 50(6), 956–967 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Bonami, P., Lejeune, M.: An exact solution approach for portfolio optimization problems under stochastic and integer constraints. Oper. Res. 57(3), 650–670 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Calafiore, G., Campi, M.C.: Uncertain convex programs: randomized solutions and confidence levels. Math. Program. 102(1), 25–46 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Campi, M.C., Garatti, S.: The exact feasibility of randomized solutions of uncertain convex programs. SIAM J. Optim. 19(3), 1211–1230 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Campi, M.C., Garatti, S.: A sampling-and-discarding approach to chance-constrained optimization: feasibility and optimality. J. Optim. Theory Appl. 148(2), 257–280 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Campi, M.C., Garatti, S., Prandini, M.: The scenario approach for systems and control design. Ann. Rev. Control 33(2), 149–157 (2009)CrossRefGoogle Scholar
  11. 11.
    Carniato, A., Camponogara, E.: Integrated coal-mining operations planning: modeling and case study. Int. J. Coal Prep. Util. 31(6), 299–334 (2011)CrossRefGoogle Scholar
  12. 12.
    Charnes, A., Cooper, W.W., Symonds, G.H.: Cost horizons and certainty equivalents: an approach to stochastic programming of heating oil. Manag. Sci. 4, 235–263 (1958)CrossRefGoogle Scholar
  13. 13.
    Chung, K.L.: A Course in Probability Theory, 2nd edn. Academic Press, New York (1974)zbMATHGoogle Scholar
  14. 14.
    Dantzig, G.B., Glynn, P.W.: Parallel processors for planning under uncertainty. Ann. Oper. Res. 22(1), 1–21 (1990)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Dentcheva, D., Prékopa, A., Ruszczynski, A.: Concavity and efficient points of discrete distributions in probabilistic programming. Math. Program. 89(1), 55–77 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Dorfleitner, G., Utz, S.: Safety first portfolio choice based on financial and sustainability returns. Eur. J. Oper. Res. 221(1), 155–164 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Duckett, W.: Risk analysis and the acceptable probability of failure. Struct. Eng. 83(15), 25–26 (2005)Google Scholar
  18. 18.
    Ermoliev, Y.M., Ermolieva, T.Y., MacDonald, G., Norkin, V.: Stochastic optimization of insurance portfolios for managing exposure to catastrophic risks. Ann. Oper. Res. 99(1–4), 207–225 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  19. 19.
    Henrion, R., Römisch, W.: Metric regularity and quantitative stability in stochastic programs with probabilistic constraints. Math. Program. 84(1), 55–88 (1999)MathSciNetzbMATHGoogle Scholar
  20. 20.
    Homem-de-Mello, T., Bayraksan, G.: Monte Carlo methods for stochastic optimization. Surv. Oper. Res. Manag. Sci. 19(1), 56–85 (2014)MathSciNetGoogle Scholar
  21. 21.
    Infanger, G.: Monte Carlo (importance) sampling within a Benders decomposition algorithm for stochastic linear programs. Ann. Oper. Res. 39(1), 69–95 (1992)MathSciNetCrossRefzbMATHGoogle Scholar
  22. 22.
    Jiang, R., Guan, Y.: Data-driven chance constrained stochastic program (2012).
  23. 23.
    Kahn, H., Harris, T.: Estimation of particle transmission by random sampling. Nat. Bur. Stand. Appl. Math. Ser. 12, 27–30 (1951)Google Scholar
  24. 24.
    L’Ecuyer, P., Mandjes, M., Tuffin, B.: Importance sampling in rare event simulation. In: Rubino, G., Tuffin, B., (eds.) Rare Event Simulation using Monte Carlo Methods, Chap. 2. Wiley, New York (2009)Google Scholar
  25. 25.
    Lejeune, M.: Pattern definition of the p-efficiency concept. Ann. Oper. Res. 200(1), 23–36 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  26. 26.
    Li, W.L., Zhang, Y., So, A.C., Win, Z.: Slow adaptive OFDMA systems through chance constrained programming. IEEE Trans. Signal Process. 58(7), 3858–3869 (2010)MathSciNetCrossRefGoogle Scholar
  27. 27.
    Liu, Y., Guo, H., Zhou, F., Qin, X., Huang, K., Yu, Y.: Inexact chance-constrained linear programming model for optimal water pollution management at the watershed scale. J. Water Resour. Plan. Manag. 134(4), 347–356 (2008)CrossRefGoogle Scholar
  28. 28.
    Luedtke, J., Ahmed, S.: A sample approximation approach for optimization with probabilistic constraints. SIAM J. Optim. 19(2), 674–699 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  29. 29.
    Minoux, M.: Discrete cost multicommodity network optimization problems and exact solution methods. Ann. Oper. Res. 106(1–4), 19–46 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  30. 30.
    Minoux, M.: Multicommodity network flow models and algorithms in telecommunications. In: Resende, M., Pardalos, P. (eds.) Handbook of Optimization in Telecommunications, pp. 163–184. Springer, Berlin (2006)Google Scholar
  31. 31.
    Nemirovski, A., Shapiro, A.: Convex approximations of chance constrained programs. SIAM J. Optim. 17(4), 969–996 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  32. 32.
    Pagnoncelli, B., Ahmed, S., Shapiro, A.: Sample average approximation method for chance constrained programming: theory and applications. J. Optim. Theory Appl. 142(2), 399–416 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  33. 33.
    Pagnoncelli, B.K., Reich, D., Campi, M.C.: Risk-return trade-off with the scenario approach in practice: a case study in portfolio selection. J. Optim. Theory Appl. 155(2), 707–722 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  34. 34.
    Prékopa, A.: Probabilistic programming. In: Ruszczyński, A., Shapiro, A. (eds.) Stochastic Programming, vol. 10, pp. 267–351. Elsevier, Amsterdam (2004)Google Scholar
  35. 35.
    Ramaswami, R., Sivarajan, K., Sasaki, G.: Optical Networks: A Practical Perspective. Morgan Kaufmann, Los Altos (2009)Google Scholar
  36. 36.
    Rockafellar, R.T., Wets, R.J.B.: Variational Analysis, A Series of Comprehensive Studies in Mathematics, vol. 317. Springer, Berlin (1998)Google Scholar
  37. 37.
    Römisch, W., Schultz, R.: Stability analysis for stochastic programs. Ann. Oper. Res. 30(1), 241–266 (1991)MathSciNetCrossRefzbMATHGoogle Scholar
  38. 38.
    Rosenbluth, M.N., Rosenbluth, A.W.: Monte Carlo calculation of the average extension of molecular chains. J. Chem. Phys. 23, 356 (1955)CrossRefGoogle Scholar
  39. 39.
    Rubinstein, R.Y.: Cross-entropy and rare events for maximal cut and partition problems. ACM Trans. Model. Comput. Simul. 12(1), 27–53 (2002)CrossRefGoogle Scholar
  40. 40.
    Rubinstein, R.Y., Shapiro, A.: Discrete Event Systems: Sensitivity Analysis and Stochastic Optimization by the Score Function Method. Wiley, Chichester (1993)zbMATHGoogle Scholar
  41. 41.
    Shapiro, A.: Monte Carlo sampling methods. In: Ruszczynski, A., Shapiro, A. (eds.) Stochastic Programming, Handbooks in Operations Research and Management Science, vol. 10. Elsevier, Amsterdam (2003)Google Scholar
  42. 42.
    Shapiro, A., Dentcheva, D., Ruszczyński, A.: Lectures on stochastic programming: modeling and theory, vol. 9. SIAM (2009)Google Scholar
  43. 43.
    Soekkha, H.M.: Aviation Safety: Human Factors, System Engineering, Flight Operations, Economics, Strategies, Management. VSP, Utrecht (1997)Google Scholar
  44. 44.
    Thieu, Q.T., Hsieh, H.Y.: Use of chance-constrained programming for solving the opportunistic spectrum sharing problem under rayleigh fading. In: 9th International Wireless Communications and Mobile Computing Conference (IWCMC), pp. 1792–1797 (2013)Google Scholar
  45. 45.
    Tran, Q.K., Parpas, P., Rustem, B., Ustun, B., Webster, M.: Importance sampling in stochastic programming: a Markov chain Monte Carlo approach (2013).
  46. 46.
    Vallejos, R., Zapata-Beghelli, A., Albornoz, V., Tarifeño, M.: Joint routing and dimensioning of optical burst switching networks. Photon Netw. Commun. 17(3), 266–276 (2009)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg and Mathematical Optimization Society 2015

Authors and Affiliations

  1. 1.Faculty of Engineering and SciencesUniversidad Adolfo IbáñezSantiagoChile
  2. 2.School of BusinessUniversidad Adolfo IbáñezSantiagoChile
  3. 3.IE&OR ProgramUniversidad Adolfo IbáñezSantiagoChile

Personalised recommendations