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

Data-Driven Robust Resource Allocation with Monotonic Cost Functions

Author

Listed:
  • Ye Chen

    (Statistical Sciences and Operations Research, Virginia Commonwealth University, Richmond, Virginia 23284)

  • Nikola Marković

    (Civil and Environmental Engineering, University of Utah, Salt Lake City, Utah 84112)

  • Ilya O. Ryzhov

    (Robert H. Smith School of Business, University of Maryland, College Park, Maryland 20742; Institute for Systems Research, University of Maryland, College Park, Maryland 20742)

  • Paul Schonfeld

    (Civil and Environmental Engineering, University of Maryland, College Park, Maryland 20742)

Abstract

We consider two-stage planning problems (arising, e.g., in city logistics) in which a resource is first divided among a set of independent regions and then costs are incurred based on the allocation to each region. Costs are assumed to be decreasing in the quantity of the resource, but their precise values are unknown, for example, if they represent difficult expected values. We develop a new data-driven uncertainty model for monotonic cost functions, which can be used in conjunction with robust optimization to obtain tractable allocation decisions that significantly improve worst-case performance outcomes. Our model uses a novel uncertainty set construction that rigorously handles monotonic structure based on a statistical goodness-of-fit test with respect to a given sample of data. The practical value of this approach is demonstrated in three realistic case studies.

Suggested Citation

  • Ye Chen & Nikola Marković & Ilya O. Ryzhov & Paul Schonfeld, 2022. "Data-Driven Robust Resource Allocation with Monotonic Cost Functions," Operations Research, INFORMS, vol. 70(1), pages 73-94, January.
    • Handle: RePEc:inm:oropre:v:70:y:2022:i:1:p:73-94
    DOI: 10.1287/opre.2021.2145
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2021.2145
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.2021.2145?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
    ---><---

    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:70:y:2022:i:1:p:73-94. 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.