Skip to main content

Archimedean Copulas in Joint Chance-Constrained Programming

  • Conference paper
  • First Online:
Operations Research and Enterprise Systems (ICORES 2014)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 509))

Included in the following conference series:

Abstract

We investigate the problem of linear joint probabilistic constraints with normally distributed constraints in this paper. We assume that the rows of the constraint matrix are dependent, the dependence is driven by a convenient Archimedean copula. We describe main properties of the problem, show how dependence modeled through copulas translates to the model formulation, and prove that the resulting problem is convex for a sufficiently high probability level. We further develop an approximation scheme for this class of stochastic programming problems based on second-order cone programming.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Prékopa, A.: Stochastic Programming. Akadémiai Kiadó, Budapest (1995)

    Book  Google Scholar 

  2. Prékopa, A.: Probabilistic programming. In: Ruszczyński, A., Shapiro, A. (eds.) Stochastic Programming. Handbooks in Operations Research and Management Science, pp. 267–352. Elsevier, Amsterdam (2003)

    Google Scholar 

  3. Dentcheva, D.: Optimization models with probabilistic constraints. In: Shapiro, A., Dentcheva, D., Ruszczyński, A. (eds.) Lectures on Stochastic Programming: Modeling and Theory. MOS-SIAM Series on Optimization, pp. 87–153. SIAM, Philadelphia (2009)

    Chapter  Google Scholar 

  4. Miller, B.L., Wagner, H.M.: Chance constrained programming with joint constraints. Oper. Res. 13, 930–945 (1965)

    Article  MATH  Google Scholar 

  5. Prékopa, A.: Logarithmic concave measures with applications to stochastic programming. Acta Scientiarium Mathematicarum (Szeged) 32, 301–316 (1971)

    MATH  Google Scholar 

  6. Jagannathan, R.: Chance-constrained programming with joint constraints. Oper. Res. 22, 358–372 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  7. Henrion, R.: Structural properties of linear probabilistic constraints. Optimization 56, 425–440 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  8. Henrion, R., Strugarek, C.: Convexity of chance constraints with independent random variables. Comput. Optim. Appl. 41, 263–276 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  9. Prékopa, A., Yoda, K., Subasi, M.M.: Uniform quasi-concavity in probabilistic constrained stochastic programming. Oper. Res. Lett. 39, 188–192 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  10. Henrion, R., Strugarek, C.: Convexity of chance constraints with dependent random variables: the use of copulae. In: Bertocchi, M., Consigli, G., Dempster, M.A.H. (eds.) Stochastic Optimization Methods in Finance and Energy. International Series in Operations Research & Management Science, pp. 427–439. Springer, New York (2011)

    Google Scholar 

  11. Nelsen, R.B.: An Introduction to Copulas, 2nd edn. Springer, New York (2006)

    MATH  Google Scholar 

  12. McNeil, A.J., Nešlehová, J.: Multivariate Archimedean copulas, \(d\)-monotone functions and \(\ell _1\)-norm symmetric distributions. Ann. Stat. 37, 3059–3097 (2009)

    Article  MATH  Google Scholar 

  13. Shapiro, A., Dentcheva, D., Ruszczyński, A.: Lectures on Stochastic Programming: Modeling and Theory. MOS-SIAM Series on Optimization. SIAM, Philadelphia (2009)

    Book  Google Scholar 

  14. Alizadeh, F., Goldfarb, D.G.: Second-order cone programming. Math. Program. 95, 3–51 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  15. Boyd, S.P., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004). Seventh printing with corrections (2009)

    Book  MATH  Google Scholar 

  16. Cheng, J., Lisser, A.: A second-order cone programming approach for linear programs with joint probabilistic constraints. Oper. Res. Lett. 40, 325–328 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  17. Cheng, J., Gicquel, C., Lisser, A.: A second-order cone programming approximation to joint chance-constrained linear programs. In: Mahjoub, A.R., Markakis, V., Milis, I., Paschos, V.T. (eds.) ISCO 2012. LNCS, vol. 7422, pp. 71–80. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  18. Wallace, S.W., Ziemba, W.T. (eds.): Applications of Stochastic Programming. MPS-SIAM Series on Optimization. SIAM, Philadelphia (2005)

    MATH  Google Scholar 

Download references

Acknowledgements

This work was supported by the Fondation Mathématiques Jacques Hadamard, PGMO/IROE grant No. 2012-042H.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Michal Houda .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Houda, M., Lisser, A. (2015). Archimedean Copulas in Joint Chance-Constrained Programming. In: Pinson, E., Valente, F., Vitoriano, B. (eds) Operations Research and Enterprise Systems. ICORES 2014. Communications in Computer and Information Science, vol 509. Springer, Cham. https://doi.org/10.1007/978-3-319-17509-6_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-17509-6_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-17508-9

  • Online ISBN: 978-3-319-17509-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics