IDEAS home Printed from https://ideas.repec.org/p/cor/louvrp/3357.html

Discount replenishment opportunities with limited capacity: Optimal policy and pricing dynamics

Author

Listed:
  • De Moor, Bram J.
  • Boute, Robert N.
  • Creemers, Stefan

    (Université catholique de Louvain, LIDAM/CORE, Belgium)

  • Gijsbrechts, Joren

Abstract

We study an inventory model with occasional discounts on the fixed order cost, where a random capacity constraint limits the quantity ordered at the discount. We prove that the optimal policy resembles a can-order policy, characterized by a unique reorder, can-order, and order-up-to level. However, the random capacity constraints on the discount offers add complexity: the optimal policy features additional thresholds for inventory levels between the reorder and can-order point that determine when to use the discount. As these inventory-specific thresholds may render the optimal policy less straightforward to implement, we develop three heuristic replenishment policies inspired by the optimal policy structure. We compare their performance in a numerical study and derive an analytical bound on their worst-case optimality gaps in settings with an infinitely high backlog cost rate. With the buyer’s optimal response to capacitated discounts in mind, we investigate the supplier’s decision to set the discount price. A high discount relative to the regular order cost increases the probability that the buyer will accept the offer, but erodes the supplier’s margin on discount sales and may reduce regular sales. We show that a mutually beneficial outcome requires buyer-to-supplier compensation.

Suggested Citation

  • De Moor, Bram J. & Boute, Robert N. & Creemers, Stefan & Gijsbrechts, Joren, 2026. "Discount replenishment opportunities with limited capacity: Optimal policy and pricing dynamics," LIDAM Reprints CORE 3357, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  • Handle: RePEc:cor:louvrp:3357
    DOI: https://doi.org/10.1016/j.ejor.2026.04.016
    Note: In: European Journal of Operational Research, 2026
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    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:cor:louvrp:3357. 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: Alain GILLIS (email available below). General contact details of provider: https://edirc.repec.org/data/coreebe.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.