IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v141y2009i3d10.1007_s10957-008-9476-1.html
   My bibliography  Save this article

Convergent Bounds for Stochastic Programs with Expected Value Constraints

Author

Listed:
  • D. Kuhn

    (Imperial College of Science, Technology, and Medicine)

Abstract

This article describes a bounding approximation scheme for convex multistage stochastic programs (MSP) that constrain the conditional expectation of some decision-dependent random variables. Expected value constraints of this type are useful for modelling a decision maker’s risk preferences, but they may also arise as artifacts of stage-aggregation. We develop two finite-dimensional approximate problems that provide bounds on the (infinite-dimensional) original problem, and we show that the gap between the bounds can be made smaller than any prescribed tolerance. Moreover, the solutions of the approximate MSPs give rise to a feasible policy for the original MSP, and this policy’s optimality gap is shown to be smaller than the difference of the bounds. The considered problem class comprises models with integrated chance constraints and conditional value-at-risk constraints. No relatively complete recourse is assumed.

Suggested Citation

  • D. Kuhn, 2009. "Convergent Bounds for Stochastic Programs with Expected Value Constraints," Journal of Optimization Theory and Applications, Springer, vol. 141(3), pages 597-618, June.
    • Handle: RePEc:spr:joptap:v:141:y:2009:i:3:d:10.1007_s10957-008-9476-1
    DOI: 10.1007/s10957-008-9476-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-008-9476-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-008-9476-1?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Alexander Shapiro, 2003. "Inference of statistical bounds for multistage stochastic programming problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 58(1), pages 57-68, September.
    2. S. E. Wright, 1994. "Primal-Dual Aggregation and Disaggregation for Stochastic Linear Programs," Mathematics of Operations Research, INFORMS, vol. 19(4), pages 893-908, November.
    3. Daniel Kuhn & Panos Parpas & Berç Rustem, 2008. "Threshold Accepting Approach to Improve Bound-based Approximations for Portfolio Optimization," Springer Books, in: Erricos J. Kontoghiorghes & Berç Rustem & Peter Winker (ed.), Computational Methods in Financial Engineering, pages 3-26, Springer.
    4. Erricos J. Kontoghiorghes & Berç Rustem & Peter Winker (ed.), 2008. "Computational Methods in Financial Engineering," Springer Books, Springer, number 978-3-540-77958-2, September.
    5. John R. Birge & Roger J.-B. Wets, 1987. "Computing Bounds for Stochastic Programming Problems by Means of a Generalized Moment Problem," Mathematics of Operations Research, INFORMS, vol. 12(1), pages 149-162, February.
    6. N. C. P. Edirisinghe & W. T. Ziemba, 1994. "Bounds for Two-Stage Stochastic Programs with Fixed Recourse," Mathematics of Operations Research, INFORMS, vol. 19(2), pages 292-313, May.
    7. Michael S. Casey & Suvrajeet Sen, 2005. "The Scenario Generation Algorithm for Multistage Stochastic Linear Programming," Mathematics of Operations Research, INFORMS, vol. 30(3), pages 615-631, August.
    8. N. C. P. Edirisinghe & W. T. Ziemba, 1994. "Bounding the Expectation of a Saddle Function with Application to Stochastic Programming," Mathematics of Operations Research, INFORMS, vol. 19(2), pages 314-340, May.
    9. Svetlozar T. Rachev & Werner Römisch, 2002. "Quantitative Stability in Stochastic Programming: The Method of Probability Metrics," Mathematics of Operations Research, INFORMS, vol. 27(4), pages 792-818, November.
    10. Karl Frauendorfer, 1988. "Solving SLP Recourse Problems with Arbitrary Multivariate Distributions---The Dependent Case," Mathematics of Operations Research, INFORMS, vol. 13(3), pages 377-394, August.
    11. Albert Madansky, 1960. "Inequalities for Stochastic Linear Programming Problems," Management Science, INFORMS, vol. 6(2), pages 197-204, January.
    12. Willem Haneveld & Maarten Vlerk, 2006. "Integrated Chance Constraints: Reduced Forms and an Algorithm," Computational Management Science, Springer, vol. 3(4), pages 245-269, September.
    13. Julia L. Higle & Suvrajeet Sen, 1991. "Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse," Mathematics of Operations Research, INFORMS, vol. 16(3), pages 650-669, August.
    14. Ronald Hochreiter & Georg Pflug, 2007. "Financial scenario generation for stochastic multi-stage decision processes as facility location problems," Annals of Operations Research, Springer, vol. 152(1), pages 257-272, July.
    15. Kjetil Høyland & Stein W. Wallace, 2001. "Generating Scenario Trees for Multistage Decision Problems," Management Science, INFORMS, vol. 47(2), pages 295-307, February.
    16. Teemu Pennanen, 2005. "Epi-Convergent Discretizations of Multistage Stochastic Programs," Mathematics of Operations Research, INFORMS, vol. 30(1), pages 245-256, February.
    17. Rockafellar, R. Tyrrell & Uryasev, Stanislav, 2002. "Conditional value-at-risk for general loss distributions," Journal of Banking & Finance, Elsevier, vol. 26(7), pages 1443-1471, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Densing, M., 2013. "Dispatch planning using newsvendor dual problems and occupation times: Application to hydropower," European Journal of Operational Research, Elsevier, vol. 228(2), pages 321-330.
    2. Dirk Lorenz & Marc Pfetsch & Andreas Tillmann, 2014. "An infeasible-point subgradient method using adaptive approximate projections," Computational Optimization and Applications, Springer, vol. 57(2), pages 271-306, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. David P. Morton & R. Kevin Wood, 1999. "Restricted-Recourse Bounds for Stochastic Linear Programming," Operations Research, INFORMS, vol. 47(6), pages 943-956, December.
    2. Steftcho P. Dokov & David P. Morton, 2005. "Second-Order Lower Bounds on the Expectation of a Convex Function," Mathematics of Operations Research, INFORMS, vol. 30(3), pages 662-677, August.
    3. Agnieszka Konicz & David Pisinger & Alex Weissensteiner, 2015. "Optimal annuity portfolio under inflation risk," Computational Management Science, Springer, vol. 12(3), pages 461-488, July.
    4. Boris Defourny & Damien Ernst & Louis Wehenkel, 2013. "Scenario Trees and Policy Selection for Multistage Stochastic Programming Using Machine Learning," INFORMS Journal on Computing, INFORMS, vol. 25(3), pages 488-501, August.
    5. Wei Zhang & Kai Wang & Alexandre Jacquillat & Shuaian Wang, 2023. "Optimized Scenario Reduction: Solving Large-Scale Stochastic Programs with Quality Guarantees," INFORMS Journal on Computing, INFORMS, vol. 35(4), pages 886-908, July.
    6. Ponomareva, K. & Roman, D. & Date, P., 2015. "An algorithm for moment-matching scenario generation with application to financial portfolio optimisation," European Journal of Operational Research, Elsevier, vol. 240(3), pages 678-687.
    7. Wim van Ackooij & Welington de Oliveira & Yongjia Song, 2018. "Adaptive Partition-Based Level Decomposition Methods for Solving Two-Stage Stochastic Programs with Fixed Recourse," INFORMS Journal on Computing, INFORMS, vol. 30(1), pages 57-70, February.
    8. Staino, Alessandro & Russo, Emilio, 2015. "A moment-matching method to generate arbitrage-free scenarios," European Journal of Operational Research, Elsevier, vol. 246(2), pages 619-630.
    9. Rocha, Paula & Kuhn, Daniel, 2012. "Multistage stochastic portfolio optimisation in deregulated electricity markets using linear decision rules," European Journal of Operational Research, Elsevier, vol. 216(2), pages 397-408.
    10. Libo Yin & Liyan Han, 2013. "Options strategies for international portfolios with overall risk management via multi-stage stochastic programming," Annals of Operations Research, Springer, vol. 206(1), pages 557-576, July.
    11. Juan Ma & Foad Mahdavi Pajouh & Balabhaskar Balasundaram & Vladimir Boginski, 2016. "The Minimum Spanning k -Core Problem with Bounded CVaR Under Probabilistic Edge Failures," INFORMS Journal on Computing, INFORMS, vol. 28(2), pages 295-307, May.
    12. Ken Kobayashi & Yuichi Takano & Kazuhide Nakata, 2021. "Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization," Journal of Global Optimization, Springer, vol. 81(2), pages 493-528, October.
    13. Ferstl, Robert & Weissensteiner, Alex, 2011. "Asset-liability management under time-varying investment opportunities," Journal of Banking & Finance, Elsevier, vol. 35(1), pages 182-192, January.
    14. Riis, Morten & Andersen, Kim Allan, 2005. "Applying the minimax criterion in stochastic recourse programs," European Journal of Operational Research, Elsevier, vol. 165(3), pages 569-584, September.
    15. Topaloglou, Nikolas & Vladimirou, Hercules & Zenios, Stavros A., 2020. "Integrated dynamic models for hedging international portfolio risks," European Journal of Operational Research, Elsevier, vol. 285(1), pages 48-65.
    16. Michael Chen & Sanjay Mehrotra & Dávid Papp, 2015. "Scenario generation for stochastic optimization problems via the sparse grid method," Computational Optimization and Applications, Springer, vol. 62(3), pages 669-692, December.
    17. Lukáš Adam & Martin Branda, 2016. "Nonlinear Chance Constrained Problems: Optimality Conditions, Regularization and Solvers," Journal of Optimization Theory and Applications, Springer, vol. 170(2), pages 419-436, August.
    18. Sodhi, ManMohan S. & Tang, Christopher S., 2009. "Modeling supply-chain planning under demand uncertainty using stochastic programming: A survey motivated by asset-liability management," International Journal of Production Economics, Elsevier, vol. 121(2), pages 728-738, October.
    19. Sun, Qi & Dong, Yucheng & Xu, Weidong, 2013. "Effects of higher order moments on the newsvendor problem," International Journal of Production Economics, Elsevier, vol. 146(1), pages 167-177.
    20. Francesca Maggioni & Elisabetta Allevi & Asgeir Tomasgard, 2020. "Bounds in multi-horizon stochastic programs," Annals of Operations Research, Springer, vol. 292(2), pages 605-625, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:141:y:2009:i:3:d:10.1007_s10957-008-9476-1. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.