IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v267y2024ics0925527323003286.html
   My bibliography  Save this article

A robust optimization approach for inventory management with limited-time discounts and service-level requirement under demand uncertainty

Author

Listed:
  • Sun, Yimeng
  • Qiu, Ruozhen
  • Sun, Minghe

Abstract

A multi-period inventory management problem is considered for a retailer offering limited-time discounts and having a joint service-level requirement over the discount periods under demand uncertainty. In each period, the retailer, only knowing a reference value and the bounds of the uncertain demand, has to determine the order quantity of the product before demand realizations to maximize the total profit over the planning horizon while achieving the required service level over the discount periods. A budgeted uncertainty set is adopted to accommodate demand uncertainty and a joint chance constraint is used to formulate the service-level requirement. The retailer problem is formulated as an affinely adjustable robust chance-constrained model and is transformed into a linear program. A double-layer iterative approach is proposed to solve the problem. The outer layer uses a posteriori method to update the budget coefficient. The inner layer solves the affinely adjustable robust chance-constrained model with the updated budget coefficient, and obtains the updated order quantities. A case study based on real data demonstrates that the proposed approach outperforms other approaches by better balancing the average realized profit and the realized service level. Moreover, the results show that the retailer can obtain a larger average realized profit by gradually than abruptly changing the prices.

Suggested Citation

  • Sun, Yimeng & Qiu, Ruozhen & Sun, Minghe, 2024. "A robust optimization approach for inventory management with limited-time discounts and service-level requirement under demand uncertainty," International Journal of Production Economics, Elsevier, vol. 267(C).
  • Handle: RePEc:eee:proeco:v:267:y:2024:i:c:s0925527323003286
    DOI: 10.1016/j.ijpe.2023.109096
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925527323003286
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ijpe.2023.109096?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.

    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:eee:proeco:v:267:y:2024:i:c:s0925527323003286. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ijpe .

    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.