Skip to main content

On the Numerical Solution of Jointly Chance Constrained Problems

  • Chapter

Part of the book series: Nonconvex Optimization and Its Applications ((NOIA,volume 49))

Abstract

This paper considers jointly chance constrained problems from the numerical point of view. The main numerical difficulties as well as techniques for overcoming these difficulties are discussed. The efficiency of the approach is illustrated by presenting computational results for large-scale jointly chance constrained test problems.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bukszár, J. (1999). Probability bounds with multitrees. Research Report RRR 5-99, RUTCOR.

    Google Scholar 

  2. Bukszár, J. and Prékopa, A. (1999). Probability bounds with cherry-trees. Research Report RRR 33-98, RUTCOR.

    Google Scholar 

  3. Deák, I. (1980). Three digit accurate multiple normal probabilities. Numerische Mathematik, 35:369–380.

    Article  MathSciNet  MATH  Google Scholar 

  4. Deák, I. (1990). Random number generators and simulation. Akadémiai Kiadó, Budapest.

    MATH  Google Scholar 

  5. Dupacovâ, J., Gaivoronski, A., Kos, Z., and Szântai, T. (1991). Stochastic programming in water management: A case study and a comparison of solution techniques. European Journal of Operational Research, 52:28–44.

    Article  MATH  Google Scholar 

  6. Gassmann, H. I. (1988). Conditional probability and conditional expectation of a random vector. In Ermoliev, Y. and Wets, R.-B., editors, Numerical Techniques for Stochastic Optimization, pages 237–254. Springer Verlag.

    Chapter  Google Scholar 

  7. Gröwe, N. (1997). Estimated stochastic programs with chance constraints. European Journal of Operational Research, 101:285–305.

    Article  MATH  Google Scholar 

  8. Kail, P. (1976). Stochastic linear programming. Springer Verlag.

    Book  Google Scholar 

  9. Kall, P. and Mayer, J. (1996). SLP-IOR: An interactive model management system for stochastic linear programs. Mathematical Programming, 75:221–240.

    MathSciNet  MATH  Google Scholar 

  10. Kail, P. and Mayer, J. (1998a). On solving stochastic linear programming problems. In Marti, K. and Kail, P., editors, Stochastic Programming Methods and Technical Applications, pages 329–344. Springer Verlag.

    Chapter  Google Scholar 

  11. Kall, P. and Mayer, J. (1998b). On testing SLP codes with SLP-IOR. In Giannessi, F., Rapcsák, T., and Komlósi, S., editors, New trends in mathematical programming, pages 115–135. Kluwer Academic Publishers.

    Google Scholar 

  12. Kail, P. and Wallace, S. W. (1994). Stochastic programming. John Wiley & Sons.

    Google Scholar 

  13. Mayer, J. (1992). Computational techniques for probabilistic constrained optimization problems. In Marti, K., editor, Stochastic Optimization: Numerical Methods and Technical Applications, pages 141–164. Springer.

    Google Scholar 

  14. Mayer, J. (1998). Stochastic Linear Programming Algorithms: A Comparison Based on a Model Management System. Gordon and Breach.

    MATH  Google Scholar 

  15. Murtagh, B. A. and Saunders, M. A. (1995). Minos 5.4 user’s guide. Technical Report SOL 83-20R, Department of Operations Research, Stanford University.

    Google Scholar 

  16. Norkin, V. I., Ermoliev, Y. M., and Ruszczynski, A. (1998). On optimal allocation of indivisibles under uncertainty. Operations Research, 46:381–395.

    Article  MATH  Google Scholar 

  17. Prékopa, A. (1971). Logarithmic concave measures with applications to stochastic programming. Acta. Sci. Math, 32:301–316.

    MATH  Google Scholar 

  18. Prékopa, A. (1988). Numerical solution of probabilistic constrained programming problems. In Ermoliev, Y. and Wets, R.-B., editors, Numerical Techniques for Stochastic Optimization, pages 123–139. Springer Verlag.

    Chapter  Google Scholar 

  19. Prékopa, A. (1995). Stochastic programming. Kluwer Academic Publishers.

    Google Scholar 

  20. Prékopa, A. (1999). The use of discrete moment bounds in probabilistic constrained stochastic programming models. Annals of Operations Research, 85:21–38.

    Article  MathSciNet  MATH  Google Scholar 

  21. Prékopa, A., Ganczer, S., Deák, I., and Patyi, K. (1980). The STABIL stochastic programming model and its experimental application to the electricity production in Hungary. In Dempster, M. A. H., editor, Stochastic Programming, pages 369–385. Academic Press.

    Google Scholar 

  22. Szántai, T. (1986). Evaluation of a special multivariate gamma distribution. Mathematical Programming Study, 27:1–16.

    Article  MATH  Google Scholar 

  23. Szántai, T. (1987). Calculation of the multivariate probability distribution function values and their gradient vectors. Working Paper WP-87-82, IIASA.

    Google Scholar 

  24. Szántai, T. (1988). A computer code for solution of probabilistic-constrained stochastic programming problems. In Ermoliev, Y. and Wets, R.-B., editors, Numerical Techniques for Stochastic Optimization, pages 229–235. Springer Verlag.

    Chapter  Google Scholar 

  25. Uryasev, S. and Rockafellar, R. T. (1999). Optimization of conditional Value-at-Risk. Research Report #99–4, Center for Applied Optimization, University of Florida.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Mayer, J. (2000). On the Numerical Solution of Jointly Chance Constrained Problems. In: Uryasev, S.P. (eds) Probabilistic Constrained Optimization. Nonconvex Optimization and Its Applications, vol 49. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3150-7_12

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-3150-7_12

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-4840-3

  • Online ISBN: 978-1-4757-3150-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics