IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v47y2015i1p84-108.html
   My bibliography  Save this article

Markdown optimization at multiple stores

Author

Listed:
  • Ming Chen
  • Zhi-Long Chen
  • Guruprasad Pundoor
  • Suresh Acharya
  • John Yi

Abstract

This article studies a markdown optimization problem commonly faced by many large retailers that involves joint decisions on inventory allocation and markdown pricing at multiple stores subject to various business rules. At the beginning of the markdown planning horizon, there is a certain amount of inventory of a product at a warehouse that needs to be allocated to many retail stores served by the warehouse over the planning horizon. In the same time, a markdown pricing scheme needs to be determined for each store over the planning horizon. A number of business rules for inventory allocation and markdown prices at the stores must be satisfied. The retailer does not have a complete knowledge about the probability distribution of the demand at a given store in a given time period. The retailer’s knowledge about the demand distributions improves over time as new information becomes available. Hence, the retailer employs a rolling horizon approach where the problem is re-solved at the beginning of each period by incorporating the latest demand information. It is shown that the problem involved at the beginning of each period is NP-hard even if the demand functions are deterministic and there is only a single store or a single time period. Thus, attention is focused on heuristic solution approaches. The stochastic demand is modeled using discrete demand scenarios based on the retailer’s latest knowledge about the demand distributions. This enables possible demand correlations to be modeled across different time periods. The problem involved at the beginning of each period is formulated as a mixed-integer program with demand scenarios and it is solved using a Lagrangian relaxation – based decomposition approach. The approach is implimented on a rolling horizon basis and it is compared with several commonly used benchmark approaches in practice. An extensive set of computational experiments is perfomed under various practical situations, and it is demonstrated that the proposed approach significantly outperforms the benchmark approaches. A number of managerial insights are derived about the impact of business rules and price sensitivity of individual stores on the total expected revenue and on the optimal inventory allocation and pricing decisions.

Suggested Citation

  • Ming Chen & Zhi-Long Chen & Guruprasad Pundoor & Suresh Acharya & John Yi, 2015. "Markdown optimization at multiple stores," IISE Transactions, Taylor & Francis Journals, vol. 47(1), pages 84-108, January.
  • Handle: RePEc:taf:uiiexx:v:47:y:2015:i:1:p:84-108
    DOI: 10.1080/0740817X.2014.916459
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/0740817X.2014.916459
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/0740817X.2014.916459?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Dasci, Abdullah & Huang, Rongbing, 2017. "A continuous approximation method for dynamic pricing problem under costly price modifications," Omega, Elsevier, vol. 72(C), pages 38-49.
    2. Ming Chen & Zhi-Long Chen, 2018. "Robust Dynamic Pricing with Two Substitutable Products," Manufacturing & Service Operations Management, INFORMS, vol. 20(2), pages 249-268, May.
    3. Wen, Xin & Choi, Tsan-Ming & Chung, Sai-Ho, 2019. "Fashion retail supply chain management: A review of operational models," International Journal of Production Economics, Elsevier, vol. 207(C), pages 34-55.

    More about this item

    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:taf:uiiexx:v:47:y:2015:i:1:p:84-108. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    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.