IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v84y2022i2d10.1007_s10898-022-01146-y.html
   My bibliography  Save this article

Data-driven stochastic optimization for distributional ambiguity with integrated confidence region

Author

Listed:
  • Steffen Rebennack

    (Karlsruhe Institute of Technology (KIT))

Abstract

We discuss stochastic optimization problems under distributional ambiguity. The distributional uncertainty is captured by considering an entire family of distributions. Because we assume the existence of data, we can consider confidence regions for the different estimators of the parameters of the distributions. Based on the definition of an appropriate estimator in the interior of the resulting confidence region, we propose a new data-driven stochastic optimization problem. This new approach applies the idea of a-posteriori Bayesian methods to the confidence region. We are able to prove that the expected value, over all observations and all possible distributions, of the optimal objective function of the proposed stochastic optimization problem is bounded by a constant. This constant is small for a sufficiently large i.i.d. sample size and depends on the chosen confidence level and the size of the confidence region. We demonstrate the utility of the new optimization approach on a Newsvendor and a reliability problem.

Suggested Citation

  • Steffen Rebennack, 2022. "Data-driven stochastic optimization for distributional ambiguity with integrated confidence region," Journal of Global Optimization, Springer, vol. 84(2), pages 255-293, October.
    • Handle: RePEc:spr:jglopt:v:84:y:2022:i:2:d:10.1007_s10898-022-01146-y
    DOI: 10.1007/s10898-022-01146-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-022-01146-y
    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/s10898-022-01146-y?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. Steffen Rebennack & Vitaliy Krasko, 2020. "Piecewise Linear Function Fitting via Mixed-Integer Linear Programming," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 507-530, April.
    2. K. Krishnamoorthy & Yanping Xia, 2018. "Confidence intervals for a two-parameter exponential distribution: One- and two-sample problems," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 47(4), pages 935-952, February.
    3. Vishal Gupta, 2019. "Near-Optimal Bayesian Ambiguity Sets for Distributionally Robust Optimization," Management Science, INFORMS, vol. 65(9), pages 4242-4260, September.
    4. Shipra Agrawal & Yichuan Ding & Amin Saberi & Yinyu Ye, 2012. "Price of Correlations in Stochastic Optimization," Operations Research, INFORMS, vol. 60(1), pages 150-162, February.
    5. Steffen Rebennack & Josef Kallrath, 2015. "Continuous Piecewise Linear Delta-Approximations for Univariate Functions: Computing Minimal Breakpoint Systems," Journal of Optimization Theory and Applications, Springer, vol. 167(2), pages 617-643, November.
    6. Gregory Steeger & Timo Lohmann & Steffen Rebennack, 2018. "Strategic bidding for a price-maker hydroelectric producer: Stochastic dual dynamic programming and Lagrangian relaxation," IISE Transactions, Taylor & Francis Journals, vol. 50(11), pages 929-942, November.
    7. Retsef Levi & Georgia Perakis & Joline Uichanco, 2015. "The Data-Driven Newsvendor Problem: New Bounds and Insights," Operations Research, INFORMS, vol. 63(6), pages 1294-1306, December.
    8. Laurent El Ghaoui & Maksim Oks & Francois Oustry, 2003. "Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach," Operations Research, INFORMS, vol. 51(4), pages 543-556, August.
    9. Steffen Rebennack & Josef Kallrath, 2015. "Continuous Piecewise Linear Delta-Approximations for Bivariate and Multivariate Functions," Journal of Optimization Theory and Applications, Springer, vol. 167(1), pages 102-117, October.
    10. Saloumeh Sadeghzadeh & Ebru K. Bish & Douglas R. Bish, 2020. "Optimal data-driven policies for disease screening under noisy biomarker measurement," IISE Transactions, Taylor & Francis Journals, vol. 52(2), pages 166-180, February.
    11. Wolfram Wiesemann & Daniel Kuhn & Melvyn Sim, 2014. "Distributionally Robust Convex Optimization," Operations Research, INFORMS, vol. 62(6), pages 1358-1376, December.
    12. Shushang Zhu & Masao Fukushima, 2009. "Worst-Case Conditional Value-at-Risk with Application to Robust Portfolio Management," Operations Research, INFORMS, vol. 57(5), pages 1155-1168, October.
    13. A. L. Soyster, 1973. "Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming," Operations Research, INFORMS, vol. 21(5), pages 1154-1157, October.
    14. A. Ben-Tal & A. Nemirovski, 1998. "Robust Convex Optimization," Mathematics of Operations Research, INFORMS, vol. 23(4), pages 769-805, November.
    15. 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.
    16. Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
    17. Helin Zhu & Joshua Hale & Enlu Zhou, 2018. "Simulation optimization of risk measures with adaptive risk levels," Journal of Global Optimization, Springer, vol. 70(4), pages 783-809, April.
    18. Jinfeng Yue & Bintong Chen & Min-Chiang Wang, 2006. "Expected Value of Distribution Information for the Newsvendor Problem," Operations Research, INFORMS, vol. 54(6), pages 1128-1136, December.
    19. George B. Dantzig, 1955. "Linear Programming under Uncertainty," Management Science, INFORMS, vol. 1(3-4), pages 197-206, 04-07.
    20. Boxiao Chen & Xiuli Chao, 2019. "Parametric demand learning with limited price explorations in a backlog stochastic inventory system," IISE Transactions, Taylor & Francis Journals, vol. 51(6), pages 605-613, June.
    21. Joel Goh & Melvyn Sim, 2010. "Distributionally Robust Optimization and Its Tractable Approximations," Operations Research, INFORMS, vol. 58(4-part-1), pages 902-917, August.
    22. Aharon Ben-Tal & Dimitris Bertsimas & David B. Brown, 2010. "A Soft Robust Model for Optimization Under Ambiguity," Operations Research, INFORMS, vol. 58(4-part-2), pages 1220-1234, August.
    23. Burcu Beykal & Styliani Avraamidou & Ioannis P. E. Pistikopoulos & Melis Onel & Efstratios N. Pistikopoulos, 2020. "DOMINO: Data-driven Optimization of bi-level Mixed-Integer NOnlinear Problems," Journal of Global Optimization, Springer, vol. 78(1), pages 1-36, September.
    24. Steffen Rebennack, 2016. "Computing tight bounds via piecewise linear functions through the example of circle cutting problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 84(1), pages 3-57, August.
    25. Lohmann, Timo & Hering, Amanda S. & Rebennack, Steffen, 2016. "Spatio-temporal hydro forecasting of multireservoir inflows for hydro-thermal scheduling," European Journal of Operational Research, Elsevier, vol. 255(1), pages 243-258.
    26. Erick Delage & Yinyu Ye, 2010. "Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems," Operations Research, INFORMS, vol. 58(3), pages 595-612, June.
    27. R. Jagannathan, 1977. "Technical Note—Minimax Procedure for a Class of Linear Programs under Uncertainty," Operations Research, INFORMS, vol. 25(1), pages 173-177, February.
    28. Georg Pflug & David Wozabal, 2007. "Ambiguity in portfolio selection," Quantitative Finance, Taylor & Francis Journals, vol. 7(4), pages 435-442.
    29. Rüdiger Schultz, 2000. "Some Aspects of Stability in Stochastic Programming," Annals of Operations Research, Springer, vol. 100(1), pages 55-84, December.
    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. Zhi Chen & Melvyn Sim & Huan Xu, 2019. "Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets," Operations Research, INFORMS, vol. 67(5), pages 1328-1344, September.
    2. Wei Liu & Li Yang & Bo Yu, 2021. "KDE distributionally robust portfolio optimization with higher moment coherent risk," Annals of Operations Research, Springer, vol. 307(1), pages 363-397, December.
    3. Wang, Fan & Zhang, Chao & Zhang, Hui & Xu, Liang, 2021. "Short-term physician rescheduling model with feature-driven demand for mental disorders outpatients," Omega, Elsevier, vol. 105(C).
    4. Guanglei Wang & Hassan Hijazi, 2018. "Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches," Computational Optimization and Applications, Springer, vol. 71(2), pages 553-608, November.
    5. Jang Ho Kim & Woo Chang Kim & Frank J. Fabozzi, 2014. "Recent Developments in Robust Portfolios with a Worst-Case Approach," Journal of Optimization Theory and Applications, Springer, vol. 161(1), pages 103-121, April.
    6. Mengshi Lu & Zuo‐Jun Max Shen, 2021. "A Review of Robust Operations Management under Model Uncertainty," Production and Operations Management, Production and Operations Management Society, vol. 30(6), pages 1927-1943, June.
    7. Zhi Chen & Weijun Xie, 2021. "Regret in the Newsvendor Model with Demand and Yield Randomness," Production and Operations Management, Production and Operations Management Society, vol. 30(11), pages 4176-4197, November.
    8. Alireza Ghahtarani & Ahmed Saif & Alireza Ghasemi, 2021. "Robust Portfolio Selection Problems: A Comprehensive Review," Papers 2103.13806, arXiv.org, revised Jan 2022.
    9. Walid Ben-Ameur & Adam Ouorou & Guanglei Wang & Mateusz Żotkiewicz, 2018. "Multipolar robust optimization," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(4), pages 395-434, December.
    10. L. Jeff Hong & Zhiyuan Huang & Henry Lam, 2021. "Learning-Based Robust Optimization: Procedures and Statistical Guarantees," Management Science, INFORMS, vol. 67(6), pages 3447-3467, June.
    11. Zhi Chen & Melvyn Sim & Peng Xiong, 2020. "Robust Stochastic Optimization Made Easy with RSOME," Management Science, INFORMS, vol. 66(8), pages 3329-3339, August.
    12. Pengyu Qian & Zizhuo Wang & Zaiwen Wen, 2015. "A Composite Risk Measure Framework for Decision Making under Uncertainty," Papers 1501.01126, arXiv.org.
    13. Andrew J. Keith & Darryl K. Ahner, 2021. "A survey of decision making and optimization under uncertainty," Annals of Operations Research, Springer, vol. 300(2), pages 319-353, May.
    14. Marla, Lavanya & Rikun, Alexander & Stauffer, Gautier & Pratsini, Eleni, 2020. "Robust modeling and planning: Insights from three industrial applications," Operations Research Perspectives, Elsevier, vol. 7(C).
    15. Alireza Ghahtarani & Ahmed Saif & Alireza Ghasemi, 2022. "Robust portfolio selection problems: a comprehensive review," Operational Research, Springer, vol. 22(4), pages 3203-3264, September.
    16. Antonio J. Conejo & Nicholas G. Hall & Daniel Zhuoyu Long & Runhao Zhang, 2021. "Robust Capacity Planning for Project Management," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1533-1550, October.
    17. Wolfram Wiesemann & Daniel Kuhn & Melvyn Sim, 2014. "Distributionally Robust Convex Optimization," Operations Research, INFORMS, vol. 62(6), pages 1358-1376, December.
    18. Jonathan Li & Roy Kwon, 2013. "Portfolio selection under model uncertainty: a penalized moment-based optimization approach," Journal of Global Optimization, Springer, vol. 56(1), pages 131-164, May.
    19. Haolin Ruan & Zhi Chen & Chin Pang Ho, 2023. "Adjustable Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets," INFORMS Journal on Computing, INFORMS, vol. 35(5), pages 1002-1023, September.
    20. Joel Goh & Melvyn Sim, 2011. "Robust Optimization Made Easy with ROME," Operations Research, INFORMS, vol. 59(4), pages 973-985, August.

    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:jglopt:v:84:y:2022:i:2:d:10.1007_s10898-022-01146-y. 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.