IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v300y2022i1p73-84.html
   My bibliography  Save this article

Distributionally robust optimization under endogenous uncertainty with an application in retrofitting planning

Author

Listed:
  • Doan, Xuan Vinh

Abstract

Endogenous uncertainty concerns uncertainty which is dependent of decisions such as link failure in the retrofitting planning application. We propose a marginal-based distributionally robust optimization framework for integer stochastic optimization with decision-dependent discrete distributions that can be applied for the retrofitting planning application. We show that the resulting model can be formulated as a mixed-integer linear optimization problem. In order to solve the problem, we develop a constraint generation algorithm given the exponentially large number of constraints. Numerical results for the retrofitting planning application show that the proposed algorithm once tailored can solve the problem efficiently.

Suggested Citation

  • Doan, Xuan Vinh, 2022. "Distributionally robust optimization under endogenous uncertainty with an application in retrofitting planning," European Journal of Operational Research, Elsevier, vol. 300(1), pages 73-84.
    • Handle: RePEc:eee:ejores:v:300:y:2022:i:1:p:73-84
    DOI: 10.1016/j.ejor.2021.07.013
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221721006081
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2021.07.013?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. Jin Y. Yen, 1971. "Finding the K Shortest Loopless Paths in a Network," Management Science, INFORMS, vol. 17(11), pages 712-716, July.
    2. Tore Jonsbråten & Roger Wets & David Woodruff, 1998. "A class of stochastic programs withdecision dependent random elements," Annals of Operations Research, Springer, vol. 82(0), pages 83-106, August.
    3. Urmila M. Diwekar, 2020. "Optimization Under Uncertainty," Springer Optimization and Its Applications, in: Introduction to Applied Optimization, edition 3, chapter 0, pages 151-215, Springer.
    4. Paul Embrechts & Giovanni Puccetti, 2006. "Bounds for Functions of Dependent Risks," Finance and Stochastics, Springer, vol. 10(3), pages 341-352, September.
    5. Dimitris Bertsimas & Xuan Vinh Doan & Karthik Natarajan & Chung-Piaw Teo, 2010. "Models for Minimax Stochastic Linear Optimization Problems with Risk Aversion," Mathematics of Operations Research, INFORMS, vol. 35(3), pages 580-602, August.
    6. Xuan Vinh Doan & Karthik Natarajan, 2012. "On the Complexity of Nonoverlapping Multivariate Marginal Bounds for Probabilistic Combinatorial Optimization Problems," Operations Research, INFORMS, vol. 60(1), pages 138-149, February.
    7. Xuan Vinh Doan & Xiaobo Li & Karthik Natarajan, 2015. "Robustness to Dependency in Portfolio Optimization Using Overlapping Marginals," Operations Research, INFORMS, vol. 63(6), pages 1468-1488, 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. Xuan Vinh Doan & Tri-Dung Nguyen, 2019. "Technical Note—Robust Newsvendor Games with Ambiguity in Demand Distributions," Operations Research, INFORMS, vol. 68(4), pages 1047-1062, July.
    2. Anulekha Dhara & Bikramjit Das & Karthik Natarajan, 2017. "Worst-Case Expected Shortfall with Univariate and Bivariate Marginals," Papers 1701.04167, arXiv.org.
    3. Anulekha Dhara & Bikramjit Das & Karthik Natarajan, 2021. "Worst-Case Expected Shortfall with Univariate and Bivariate Marginals," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 370-389, January.
    4. Xuan Vinh Doan & Xiaobo Li & Karthik Natarajan, 2015. "Robustness to Dependency in Portfolio Optimization Using Overlapping Marginals," Operations Research, INFORMS, vol. 63(6), pages 1468-1488, December.
    5. Napat Rujeerapaiboon & Daniel Kuhn & Wolfram Wiesemann, 2016. "Robust Growth-Optimal Portfolios," Management Science, INFORMS, vol. 62(7), pages 2090-2109, July.
    6. Stefan Mittnik & Sandra Paterlini & Tina Yener, 2011. "Operational–risk Dependencies and the Determination of Risk Capital," Center for Economic Research (RECent) 070, University of Modena and Reggio E., Dept. of Economics "Marco Biagi".
    7. Thibaut Lux & Antonis Papapantoleon, 2016. "Model-free bounds on Value-at-Risk using extreme value information and statistical distances," Papers 1610.09734, arXiv.org, revised Nov 2018.
    8. Daria Dzyabura & Srikanth Jagabathula, 2018. "Offline Assortment Optimization in the Presence of an Online Channel," Management Science, INFORMS, vol. 64(6), pages 2767-2786, June.
    9. Manish Bansal & Yingqiu Zhang, 2021. "Scenario-based cuts for structured two-stage stochastic and distributionally robust p-order conic mixed integer programs," Journal of Global Optimization, Springer, vol. 81(2), pages 391-433, October.
    10. Timothy M. Sweda & Irina S. Dolinskaya & Diego Klabjan, 2017. "Adaptive Routing and Recharging Policies for Electric Vehicles," Transportation Science, INFORMS, vol. 51(4), pages 1326-1348, November.
    11. Henryk Zähle, 2022. "A concept of copula robustness and its applications in quantitative risk management," Finance and Stochastics, Springer, vol. 26(4), pages 825-875, October.
    12. Kaas, Rob & Laeven, Roger J.A. & Nelsen, Roger B., 2009. "Worst VaR scenarios with given marginals and measures of association," Insurance: Mathematics and Economics, Elsevier, vol. 44(2), pages 146-158, April.
    13. Hofert Marius & Memartoluie Amir & Saunders David & Wirjanto Tony, 2017. "Improved algorithms for computing worst Value-at-Risk," Statistics & Risk Modeling, De Gruyter, vol. 34(1-2), pages 13-31, June.
    14. Hela Masri & Saoussen Krichen, 2018. "Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem," Annals of Operations Research, Springer, vol. 267(1), pages 353-377, August.
    15. Xuan Wang & Jiawei Zhang, 2015. "Process Flexibility: A Distribution-Free Bound on the Performance of k -Chain," Operations Research, INFORMS, vol. 63(3), pages 555-571, June.
    16. Alessandra Griffa & Mathieu Mach & Julien Dedelley & Daniel Gutierrez-Barragan & Alessandro Gozzi & Gilles Allali & Joanes Grandjean & Dimitri Ville & Enrico Amico, 2023. "Evidence for increased parallel information transmission in human brain networks compared to macaques and male mice," Nature Communications, Nature, vol. 14(1), pages 1-15, December.
    17. Zhou, Bo & Eskandarian, Azim, 2006. "A Non-Deterministic Path Generation Algorithm for Traffic Networks," 47th Annual Transportation Research Forum, New York, New York, March 23-25, 2006 208047, Transportation Research Forum.
    18. Ma, Jie & Meng, Qiang & Cheng, Lin & Liu, Zhiyuan, 2022. "General stochastic ridesharing user equilibrium problem with elastic demand," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 162-194.
    19. Laeven, Roger J.A., 2009. "Worst VaR scenarios: A remark," Insurance: Mathematics and Economics, Elsevier, vol. 44(2), pages 159-163, April.
    20. Meysam Cheramin & Jianqiang Cheng & Ruiwei Jiang & Kai Pan, 2022. "Computationally Efficient Approximations for Distributionally Robust Optimization Under Moment and Wasserstein Ambiguity," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1768-1794, May.

    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:eee:ejores:v:300:y:2022:i:1:p:73-84. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.