IDEAS home Printed from https://ideas.repec.org/a/spr/comgts/v21y2024i1d10.1007_s10287-024-00512-3.html
   My bibliography  Save this article

Distributions and bootstrap for data-based stochastic programming

Author

Listed:
  • Xiaotie Chen

    (UC Davis)

  • David L. Woodruff

    (UC Davis)

Abstract

In the context of optimization under uncertainty, we consider various combinations of distribution estimation and resampling (bootstrap and bagging) for obtaining samples used to estimate a confidence interval for an optimality gap. This paper makes three experimental contributions to on-going research in data driven stochastic programming: (a) most of the combinations of distribution estimation and resampling result in algorithms that have not been published before, (b) within the algorithms, we describe innovations that improve performance, and (c) we provide open-source software implementations of the algorithms. Among others, three important conclusions can be drawn: using a smoothed point estimate for the optimality gap for the center of the confidence interval is preferable to a purely empirical estimate, bagging often performs better than bootstrap, and smoothed bagging sometimes performs better than bagging based directly on the data.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:comgts:v:21:y:2024:i:1:d:10.1007_s10287-024-00512-3
    DOI: 10.1007/s10287-024-00512-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10287-024-00512-3
    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/s10287-024-00512-3?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. Güzin Bayraksan & David P. Morton, 2011. "A Sequential Sampling Procedure for Stochastic Programming," Operations Research, INFORMS, vol. 59(4), pages 898-913, August.
    2. Jeff Linderoth & Alexander Shapiro & Stephen Wright, 2006. "The empirical behavior of sampling methods for stochastic programming," Annals of Operations Research, Springer, vol. 142(1), pages 215-241, February.
    3. 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.
    4. 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.
    5. Panos Parpas & Berk Ustun & Mort Webster & Quang Kha Tran, 2015. "Importance Sampling in Stochastic Programming: A Markov Chain Monte Carlo Approach," INFORMS Journal on Computing, INFORMS, vol. 27(2), pages 358-377, May.
    6. Vaagen, Hajnalka & Wallace, Stein W., 2008. "Product variety arising from hedging in the fashion supply chains," International Journal of Production Economics, Elsevier, vol. 114(2), pages 431-455, August.
    7. Andreas Eichhorn & Werner Römisch, 2007. "Stochastic Integer Programming: Limit Theorems and Confidence Intervals," Mathematics of Operations Research, INFORMS, vol. 32(1), pages 118-135, February.
    8. Vitor L. de Matos & David P. Morton & Erlon C. Finardi, 2017. "Assessing policy quality in a multistage stochastic program for long-term hydrothermal scheduling," Annals of Operations Research, Springer, vol. 253(2), pages 713-731, June.
    9. Woonghee Tim Huh & Retsef Levi & Paat Rusmevichientong & James B. Orlin, 2011. "Adaptive Data-Driven Inventory Control with Censored Demand Based on Kaplan-Meier Estimator," Operations Research, INFORMS, vol. 59(4), pages 929-941, August.
    10. 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.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    2. Narum, Benjamin S. & Fairbrother, Jamie & Wallace, Stein W., 2024. "Problem-based scenario generation by decomposing output distributions," European Journal of Operational Research, Elsevier, vol. 318(1), pages 154-166.
    3. 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.
    4. Suvrajeet Sen & Yifan Liu, 2016. "Mitigating Uncertainty via Compromise Decisions in Two-Stage Stochastic Linear Programming: Variance Reduction," Operations Research, INFORMS, vol. 64(6), pages 1422-1437, December.
    5. Panos Parpas & Berk Ustun & Mort Webster & Quang Kha Tran, 2015. "Importance Sampling in Stochastic Programming: A Markov Chain Monte Carlo Approach," INFORMS Journal on Computing, INFORMS, vol. 27(2), pages 358-377, May.
    6. Yunxiao Deng & Suvrajeet Sen, 2022. "Predictive stochastic programming," Computational Management Science, Springer, vol. 19(1), pages 65-98, January.
    7. Jangho Park & Rebecca Stockbridge & Güzin Bayraksan, 2021. "Variance reduction for sequential sampling in stochastic programming," Annals of Operations Research, Springer, vol. 300(1), pages 171-204, May.
    8. 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.
    9. Emelogu, Adindu & Chowdhury, Sudipta & Marufuzzaman, Mohammad & Bian, Linkan & Eksioglu, Burak, 2016. "An enhanced sample average approximation method for stochastic optimization," International Journal of Production Economics, Elsevier, vol. 182(C), pages 230-252.
    10. Fei, Xin & Gülpınar, Nalân & Branke, Jürgen, 2019. "Efficient solution selection for two-stage stochastic programs," European Journal of Operational Research, Elsevier, vol. 277(3), pages 918-929.
    11. 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.
    12. Martin Šmíd & Václav Kozmík, 2024. "Approximation of multistage stochastic programming problems by smoothed quantization," Review of Managerial Science, Springer, vol. 18(7), pages 2079-2114, July.
    13. Georgia Perakis & Melvyn Sim & Qinshen Tang & Peng Xiong, 2023. "Robust Pricing and Production with Information Partitioning and Adaptation," Management Science, INFORMS, vol. 69(3), pages 1398-1419, March.
    14. Blanchot, Xavier & Clautiaux, François & Detienne, Boris & Froger, Aurélien & Ruiz, Manuel, 2023. "The Benders by batch algorithm: Design and stabilization of an enhanced algorithm to solve multicut Benders reformulation of two-stage stochastic programs," European Journal of Operational Research, Elsevier, vol. 309(1), pages 202-216.
    15. E. Ruben van Beesten & Nick W. Koning & David P. Morton, 2024. "Assessing solution quality in risk-averse stochastic programs," Papers 2408.15690, arXiv.org.
    16. Johannes Royset, 2013. "On sample size control in sample average approximations for solving smooth stochastic programs," Computational Optimization and Applications, Springer, vol. 55(2), pages 265-309, June.
    17. 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.
    18. 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.
    19. Martin Biel & Mikael Johansson, 2022. "Efficient Stochastic Programming in Julia," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 1885-1902, July.
    20. Harsha Gangammanavar & Yifan Liu & Suvrajeet Sen, 2021. "Stochastic Decomposition for Two-Stage Stochastic Linear Programs with Random Cost Coefficients," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 51-71, January.

    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:comgts:v:21:y:2024:i:1:d:10.1007_s10287-024-00512-3. 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.