IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v58y2003i1p57-68.html
   My bibliography  Save this article

Inference of statistical bounds for multistage stochastic programming problems

Author

Listed:
  • Alexander Shapiro

Abstract

We discuss in this paper statistical inference of sample average approximations of multistage stochastic programming problems. We show that any random sampling scheme provides a valid statistical lower bound for the optimal (minimum) value of the true problem. However, in order for such lower bound to be consistent one needs to employ the conditional sampling procedure. We also indicate that fixing a feasible first-stage solution and then solving the sampling approximation of the corresponding (T−1)-stage problem, does not give a valid statistical upper bound for the optimal value of the true problem. Copyright Springer-Verlag 2003

Suggested Citation

  • 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.
    • Handle: RePEc:spr:mathme:v:58:y:2003:i:1:p:57-68
    DOI: 10.1007/s001860300280
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s001860300280
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s001860300280?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.

    Citations

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


    Cited by:

    1. Sha, Yue & Zhang, Junlong & Cao, Hui, 2021. "Multistage stochastic programming approach for joint optimization of job scheduling and material ordering under endogenous uncertainties," European Journal of Operational Research, Elsevier, vol. 290(3), pages 886-900.
    2. 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.
    3. Xiaotie Chen & David L. Woodruff, 2024. "Distributions and bootstrap for data-based stochastic programming," Computational Management Science, Springer, vol. 21(1), pages 1-21, June.
    4. Xiaomin Xi & Ramteen Sioshansi, 2016. "A dynamic programming model of energy storage and transformer deployments to relieve distribution constraints," Computational Management Science, Springer, vol. 13(1), pages 119-146, January.
    5. Georg Pflug & Alois Pichler, 2015. "Dynamic generation of scenario trees," Computational Optimization and Applications, Springer, vol. 62(3), pages 641-668, December.
    6. Xiaotie Chen & David L. Woodruff, 2023. "Software for Data-Based Stochastic Programming Using Bootstrap Estimation," INFORMS Journal on Computing, INFORMS, vol. 35(6), pages 1218-1224, November.
    7. Baker, Erin & Solak, Senay, 2011. "Climate change and optimal energy technology R&D policy," European Journal of Operational Research, Elsevier, vol. 213(2), pages 442-454, September.
    8. Arnab Bhattacharya & Jeffrey P. Kharoufeh & Bo Zeng, 2023. "A Nonconvex Regularization Scheme for the Stochastic Dual Dynamic Programming Algorithm," INFORMS Journal on Computing, INFORMS, vol. 35(5), pages 1161-1178, September.
    9. Shin, Youngchul & Lee, Sangyoon & Moon, Ilkyeong, 2020. "Robust multiperiod inventory model considering trade-in program and refurbishment service: Implications to emerging markets," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 138(C).
    10. Gauthier Maere d’Aertrycke & Alexander Shapiro & Yves Smeers, 2013. "Risk exposure and Lagrange multipliers of nonanticipativity constraints in multistage stochastic problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 77(3), pages 393-405, June.
    11. 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.
    12. Agnieszka Konicz & David Pisinger & Alex Weissensteiner, 2015. "Optimal annuity portfolio under inflation risk," Computational Management Science, Springer, vol. 12(3), pages 461-488, July.
    13. Eyyüb Y. Kıbış & İ. Esra Büyüktahtakın & Robert G. Haight & Najmaddin Akhundov & Kathleen Knight & Charles E. Flower, 2021. "A Multistage Stochastic Programming Approach to the Optimal Surveillance and Control of the Emerald Ash Borer in Cities," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 808-834, May.
    14. Solak, Senay & Clarke, John-Paul B. & Johnson, Ellis L. & Barnes, Earl R., 2010. "Optimization of R&D project portfolios under endogenous uncertainty," European Journal of Operational Research, Elsevier, vol. 207(1), pages 420-433, November.
    15. Senay Solak & Gustaf Solveling & John-Paul B. Clarke & Ellis L. Johnson, 2018. "Stochastic Runway Scheduling," Transportation Science, INFORMS, vol. 52(4), pages 917-940, August.
    16. 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.

    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:mathme:v:58:y:2003:i:1:p:57-68. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.