IDEAS home Printed from https://ideas.repec.org/a/spr/aqjoor/v20y2022i3d10.1007_s10288-021-00484-z.html
   My bibliography  Save this article

Partition-based distributionally robust optimization via optimal transport with order cone constraints

Author

Listed:
  • Adrián Esteban-Pérez

    (University of Málaga)

  • Juan M. Morales

    (University of Málaga)

Abstract

In this paper we wish to tackle stochastic programs affected by ambiguity about the probability law that governs their uncertain parameters. Using optimal transport theory, we construct an ambiguity set that exploits the knowledge about the distribution of the uncertain parameters, which is provided by: (1) sample data and (2) a-priori information on the order among the probabilities that the true data-generating distribution assigns to some regions of its support set. This type of order is enforced by means of order cone constraints and can encode a wide range of information on the shape of the probability distribution of the uncertain parameters such as information related to monotonicity or multi-modality. We seek decisions that are distributionally robust. In a number of practical cases, the resulting distributionally robust optimization (DRO) problem can be reformulated as a finite convex problem where the a-priori information translates into linear constraints. In addition, our method inherits the finite-sample performance guarantees of the Wasserstein-metric-based DRO approach proposed by Mohajerin Esfahani and Kuhn (Math Program 171(1–2):115–166. https://doi.org/10.1007/s10107-017-1172-1 , 2018), while generalizing this and other popular DRO approaches. Finally, we have designed numerical experiments to analyze the performance of our approach with the newsvendor problem and the problem of a strategic firm competing à la Cournot in a market.

Suggested Citation

  • Adrián Esteban-Pérez & Juan M. Morales, 2022. "Partition-based distributionally robust optimization via optimal transport with order cone constraints," 4OR, Springer, vol. 20(3), pages 465-497, September.
    • Handle: RePEc:spr:aqjoor:v:20:y:2022:i:3:d:10.1007_s10288-021-00484-z
    DOI: 10.1007/s10288-021-00484-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10288-021-00484-z
    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/s10288-021-00484-z?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. Zhi Chen & Melvyn Sim & Peng Xiong, 2020. "Robust Stochastic Optimization Made Easy with RSOME," Management Science, INFORMS, vol. 66(8), pages 3329-3339, August.
    2. Aharon Ben-Tal & Dick den Hertog & Anja De Waegenaere & Bertrand Melenberg & Gijs Rennen, 2013. "Robust Solutions of Optimization Problems Affected by Uncertain Probabilities," Management Science, INFORMS, vol. 59(2), pages 341-357, April.
    3. Sanjay Mehrotra & David Papp, 2013. "A cutting surface algorithm for semi-infinite convex programming with an application to moment robust optimization," Papers 1306.3437, arXiv.org, revised Aug 2014.
    4. Pando, Valentín & San-José, Luis A. & García-Laguna, Juan & Sicilia, Joaquín, 2013. "A newsboy problem with an emergency order under a general backorder rate function," Omega, Elsevier, vol. 41(6), pages 1020-1028.
    5. Andersson, Jonas & Jörnsten, Kurt & Nonås, Sigrid Lise & Sandal, Leif & Ubøe, Jan, 2013. "A maximum entropy approach to the newsvendor problem with partial information," European Journal of Operational Research, Elsevier, vol. 228(1), pages 190-200.
    6. 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.
    7. Henry Lam & Clementine Mottet, 2017. "Tail Analysis Without Parametric Models: A Worst-Case Perspective," Operations Research, INFORMS, vol. 65(6), pages 1696-1711, December.
    8. V. Pando & L. San-José & J. García-Laguna & J. Sicilia, 2014. "Some general properties for the newsboy problem with an extraordinary order," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(2), pages 674-693, July.
    9. 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.
    10. Xin, Linwei & Goldberg, David A., 2021. "Time (in)consistency of multistage distributionally robust inventory models with moment constraints," European Journal of Operational Research, Elsevier, vol. 289(3), pages 1127-1141.
    11. Dariush Khezrimotlagh & Yao Chen, 2018. "The Optimization Approach," International Series in Operations Research & Management Science, in: Decision Making and Performance Evaluation Using Data Envelopment Analysis, chapter 0, pages 107-134, Springer.
    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. Shanshan Wang & Erick Delage, 2024. "A Column Generation Scheme for Distributionally Robust Multi-Item Newsvendor Problems," INFORMS Journal on Computing, INFORMS, vol. 36(3), pages 849-867, May.
    2. 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.
    3. Yu Wang & Yu Zhang & Minglong Zhou & Jiafu Tang, 2023. "Feature‐driven robust surgery scheduling," Production and Operations Management, Production and Operations Management Society, vol. 32(6), pages 1921-1938, June.
    4. Xiangyi Fan & Grani A. Hanasusanto, 2024. "A Decision Rule Approach for Two-Stage Data-Driven Distributionally Robust Optimization Problems with Random Recourse," INFORMS Journal on Computing, INFORMS, vol. 36(2), pages 526-542, March.
    5. Maximilian Blesch & Philipp Eisenhauer, 2023. "Robust Decision-Making under Risk and Ambiguity," Rationality and Competition Discussion Paper Series 463, CRC TRR 190 Rationality and Competition.
    6. Irfanullah Khan & Biswajit Sarkar, 2021. "Transfer of Risk in Supply Chain Management with Joint Pricing and Inventory Decision Considering Shortages," Mathematics, MDPI, vol. 9(6), pages 1-20, March.
    7. Soroush Saghafian & Brian Tomlin, 2016. "The Newsvendor under Demand Ambiguity: Combining Data with Moment and Tail Information," Operations Research, INFORMS, vol. 64(1), pages 167-185, February.
    8. Aleksandrina Goeva & Henry Lam & Huajie Qian & Bo Zhang, 2019. "Optimization-Based Calibration of Simulation Input Models," Operations Research, INFORMS, vol. 67(5), pages 1362-1382, September.
    9. Ren, Ke & Bidkhori, Hoda, 2023. "A study of data-driven distributionally robust optimization with incomplete joint data under finite support," European Journal of Operational Research, Elsevier, vol. 305(2), pages 754-765.
    10. Cheng, Chun & Yu, Qinxiao & Adulyasak, Yossiri & Rousseau, Louis-Martin, 2024. "Distributionally robust facility location with uncertain facility capacity and customer demand," Omega, Elsevier, vol. 122(C).
    11. Zhi Chen & Peng Xiong, 2023. "RSOME in Python: An Open-Source Package for Robust Stochastic Optimization Made Easy," INFORMS Journal on Computing, INFORMS, vol. 35(4), pages 717-724, July.
    12. Aakil M. Caunhye & Douglas Alem, 2023. "Practicable robust stochastic optimization under divergence measures with an application to equitable humanitarian response planning," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 45(3), pages 759-806, September.
    13. Feng Liu & Zhi Chen & Shuming Wang, 2023. "Globalized Distributionally Robust Counterpart," INFORMS Journal on Computing, INFORMS, vol. 35(5), pages 1120-1142, September.
    14. Zhiping Chen & Wentao Ma, 2024. "A Bayesian approach to data-driven multi-stage stochastic optimization," Journal of Global Optimization, Springer, vol. 90(2), pages 401-428, October.
    15. 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.
    16. Meng, Zhu & Zhu, Ning & Zhang, Guowei & Yang, Yuance & Liu, Zhaocai & Ke, Ginger Y., 2024. "Data-driven drone pre-positioning for traffic accident rapid assessment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 183(C).
    17. Qiu, Ruozhen & Sun, Minghe & Lim, Yun Fong, 2017. "Optimizing (s, S) policies for multi-period inventory models with demand distribution uncertainty: Robust dynamic programing approaches," European Journal of Operational Research, Elsevier, vol. 261(3), pages 880-892.
    18. Shunichi Ohmori, 2021. "A Predictive Prescription Using Minimum Volume k -Nearest Neighbor Enclosing Ellipsoid and Robust Optimization," Mathematics, MDPI, vol. 9(2), pages 1-16, January.
    19. Ruidi Chen & Ioannis Ch. Paschalidis, 2022. "Robust Grouped Variable Selection Using Distributionally Robust Optimization," Journal of Optimization Theory and Applications, Springer, vol. 194(3), pages 1042-1071, September.
    20. Weiwei Fan & L. Jeff Hong & Xiaowei Zhang, 2020. "Distributionally Robust Selection of the Best," Management Science, INFORMS, vol. 66(1), pages 190-208, 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:aqjoor:v:20:y:2022:i:3:d:10.1007_s10288-021-00484-z. 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.