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

Near-Optimal Mixed ( s,S ) Policy for a Multiwarehouse, Multistore Inventory System with Lost Sales and Fixed Cost

Author

Listed:
  • Sentao Miao

    (Leeds School of Business, University of Colorado, Boulder, Colorado 80309)

  • Stefanus Jasin

    (Stephen M. Ross School of Business, University of Michigan, Ann Arbor, Michigan 48109)

  • Xiuli Chao

    (Industrial and Operations Engineering, University of Michigan, Ann Arbor, Michigan 48109)

Abstract

We consider a firm managing a multiperiod, multiwarehouse, multistore (MWMS) inventory problem with fixed ordering cost at each store over a finite time horizon. The warehouses are endowed with initial inventories at the start of the horizon, and the stores are periodically replenished from the warehouses. The decisions are the order quantities from each store at each period. The optimal policy for this problem is complex and computationally intractable. We construct a mixed ( s , S ) policy based on the optimal solutions of a Lagrangian relaxation. Under this policy, each store makes use of at most two ( s , S ) policies; one is applied during the first phase of the selling horizon, and the second is applied in the remaining periods. We prove that this policy is near optimal as the length of the time horizon grows. In contrast to the existing works on the MWMS problem without fixed cost for which near-optimal policies can be developed using an optimal Lagrangian solution, with fixed cost, it is crucial to adopt a mixture of Lagrangian solutions, and simply applying a pure optimal Lagrangian solution can be highly suboptimal.

Suggested Citation

  • Sentao Miao & Stefanus Jasin & Xiuli Chao, 2025. "Near-Optimal Mixed ( s,S ) Policy for a Multiwarehouse, Multistore Inventory System with Lost Sales and Fixed Cost," Operations Research, INFORMS, vol. 73(5), pages 2306-2318, September.
  • Handle: RePEc:inm:oropre:v:73:y:2025:i:5:p:2306-2318
    DOI: 10.1287/opre.2024.0717
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1287/opre.2024.0717?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:5:p:2306-2318. 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.