IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v73y2025i4p2146-2155.html
   My bibliography  Save this article

A Short and General Duality Proof for Wasserstein Distributionally Robust Optimization

Author

Listed:
  • Luhao Zhang

    (Department of Applied Mathematics and Statistics, Johns Hopkins University, Baltimore, Maryland 21218)

  • Jincheng Yang

    (Department of Mathematics, University of Chicago, Chicago, Illinois 60637)

  • Rui Gao

    (Department of Information, Risk and Operations Management, The University of Texas at Austin, Austin, Texas 78712)

Abstract

We present a general duality result for Wasserstein distributionally robust optimization that holds for any Kantorovich transport cost, measurable loss function, and nominal probability distribution. Assuming an interchangeability principle inherent in existing duality results, our proof only uses one-dimensional convex analysis. Furthermore, we demonstrate that the interchangeability principle holds if and only if certain measurable projection and weak measurable selection conditions are satisfied. To illustrate the broader applicability of our approach, we provide a rigorous treatment of duality results in distributionally robust Markov decision processes and distributionally robust multistage stochastic programming. Additionally, we extend our analysis to other problems such as infinity-Wasserstein distributionally robust optimization, risk-averse optimization, and globalized distributionally robust counterpart.

Suggested Citation

  • Luhao Zhang & Jincheng Yang & Rui Gao, 2025. "A Short and General Duality Proof for Wasserstein Distributionally Robust Optimization," Operations Research, INFORMS, vol. 73(4), pages 2146-2155, July.
  • Handle: RePEc:inm:oropre:v:73:y:2025:i:4:p:2146-2155
    DOI: 10.1287/opre.2023.0135
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2023.0135
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.2023.0135?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
    ---><---

    More about this item

    Keywords

    ;

    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:inm:oropre:v:73:y:2025:i:4:p:2146-2155. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.