IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2010.16369.html

Distributionally Robust Newsvendor with Moment Constraints

Author

Listed:
  • Derek Singh
  • Shuzhong Zhang

Abstract

This paper expands the work on distributionally robust newsvendor to incorporate moment constraints. The use of Wasserstein distance as the ambiguity measure is preserved. The infinite dimensional primal problem is formulated; problem of moments duality is invoked to derive the simpler finite dimensional dual problem. An important research question is: How does distributional ambiguity affect the optimal order quantity and the corresponding profits/costs? To investigate this, some theory is developed and a case study in auto sales is performed. We conclude with some comments on directions for further research.

Suggested Citation

  • Derek Singh & Shuzhong Zhang, 2020. "Distributionally Robust Newsvendor with Moment Constraints," Papers 2010.16369, arXiv.org.
    • Handle: RePEc:arx:papers:2010.16369
    as

    Download full text from publisher

    File URL: https://arxiv.org/pdf/2010.16369
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Karthik Natarajan & Melvyn Sim & Joline Uichanco, 2018. "Asymmetry and Ambiguity in Newsvendor Models," Management Science, INFORMS, vol. 64(7), pages 3146-3167, July.
    2. Derek Singh & Shuzhong Zhang, 2020. "Tight Bounds for a Class of Data-Driven Distributionally Robust Risk Measures," Papers 2010.05398, arXiv.org, revised Oct 2020.
    3. Jose Blanchet & Karthyek Murthy, 2019. "Quantifying Distributional Model Risk via Optimal Transport," Mathematics of Operations Research, INFORMS, vol. 44(2), pages 565-600, May.
    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. Bikramjit Das & Anulekha Dhara & Karthik Natarajan, 2021. "On the Heavy-Tail Behavior of the Distributionally Robust Newsvendor," Operations Research, INFORMS, vol. 69(4), pages 1077-1099, July.
    2. Rahimian, Hamed & Bayraksan, Güzin & Homem-de-Mello, Tito, 2019. "Controlling risk and demand ambiguity in newsvendor models," European Journal of Operational Research, Elsevier, vol. 279(3), pages 854-868.
    3. 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.
    4. Marlon R. Moresco & Mélina Mailhot & Silvana M. Pesenti, 2025. "Uncertainty Propagation and Dynamic Robust Risk Measures," Mathematics of Operations Research, INFORMS, vol. 50(3), pages 1939-1964, August.
    5. Jose Blanchet & Henry Lam & Yang Liu & Ruodu Wang, 2025. "Convolution Bounds on Quantile Aggregation," Operations Research, INFORMS, vol. 73(5), pages 2761-2781, September.
    6. Jose Blanchet & Karthyek Murthy & Fan Zhang, 2022. "Optimal Transport-Based Distributionally Robust Optimization: Structural Properties and Iterative Schemes," Mathematics of Operations Research, INFORMS, vol. 47(2), pages 1500-1529, May.
    7. Viet Anh Nguyen & Fan Zhang & Shanshan Wang & Jose Blanchet & Erick Delage & Yinyu Ye, 2021. "Robustifying Conditional Portfolio Decisions via Optimal Transport," Papers 2103.16451, arXiv.org, revised Apr 2024.
    8. Meng Qi & Ying Cao & Zuo-Jun (Max) Shen, 2022. "Distributionally Robust Conditional Quantile Prediction with Fixed Design," Management Science, INFORMS, vol. 68(3), pages 1639-1658, March.
    9. Wouter van Eekelen & Dick den Hertog & Johan S.H. van Leeuwaarden, 2022. "MAD Dispersion Measure Makes Extremal Queue Analysis Simple," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1681-1692, May.
    10. Qian, Cheng & Li, Zhaolin & Fu, Qi, 2026. "Managing inventory and financing decisions under ambiguity," Omega, Elsevier, vol. 140(C).
    11. Anthony Coache & Sebastian Jaimungal, 2024. "Robust Reinforcement Learning with Dynamic Distortion Risk Measures," Papers 2409.10096, arXiv.org, revised Sep 2025.
    12. Xuejun Zhao & William B. Haskell & Guodong Yu, 2024. "Supply Chain Contracts in the Small Data Regime," Manufacturing & Service Operations Management, INFORMS, vol. 26(4), pages 1387-1401, July.
    13. Yijie Wang & Viet Anh Nguyen & Grani A. Hanasusanto, 2024. "Wasserstein Robust Classification with Fairness Constraints," Manufacturing & Service Operations Management, INFORMS, vol. 26(4), pages 1567-1585, July.
    14. Luhao Zhang & Jincheng Yang & Rui Gao, 2024. "Optimal Robust Policy for Feature-Based Newsvendor," Management Science, INFORMS, vol. 70(4), pages 2315-2329, April.
    15. Dohyun Ahn & Huiyi Chen & Lewen Zheng, 2026. "Wasserstein Distributionally Robust Rare-Event Simulation," Papers 2601.01642, arXiv.org.
    16. Hongseok Namkoong & Yuanzhe Ma & Peter W. Glynn, 2026. "Minimax Optimal Estimation of Stability Under Distribution Shift," Operations Research, INFORMS, vol. 74(1), pages 464-483, January.
    17. Omar Besbes & Omar Mouchtaki, 2023. "How Big Should Your Data Really Be? Data-Driven Newsvendor: Learning One Sample at a Time," Management Science, INFORMS, vol. 69(10), pages 5848-5865, October.
    18. Mingyang Fu & Xiaobo Li & Lianmin Zhang, 2024. "Distributionally Robust Newsvendor Under Stochastic Dominance with a Feature-Based Application," Manufacturing & Service Operations Management, INFORMS, vol. 26(5), pages 1962-1977, September.
    19. Kopa, Miloš & Rusý, Tomáš, 2023. "Robustness of stochastic programs with endogenous randomness via contamination," European Journal of Operational Research, Elsevier, vol. 305(3), pages 1259-1272.
    20. Garces, Len Patrick Dominic M. & Shen, Yang, 2025. "Robust optimal investment and consumption strategies with portfolio constraints and stochastic environment," European Journal of Operational Research, Elsevier, vol. 322(2), pages 693-712.

    More about this item

    Statistics

    Access and download statistics

    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:arx:papers:2010.16369. 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: arXiv administrators (email available below). General contact details of provider: https://arxiv.org/ .

    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.