IDEAS home Printed from https://ideas.repec.org/p/cte/wsrepe/ws093111.html

An index for dynamic product promotion and the knapsack problem for perishable items

Author

Listed:
  • Jacko, Peter
  • Niño Mora, José

Abstract

This paper introduces the knapsack problem for perishable items (KPPI), which concerns the optimal dynamic allocation of a limited promotion space to a collection of perishable items. Such a problem is motivated by applications in a variety of industries, where products have an associated lifetime after which they cannot be sold. The paper builds on recent developments on restless bandit indexation and gives an optimal marginal productivity index policy for the dynamic (single) product promotion problem with closed-form indices that yield estructural insights. The performance of the proposed policy for KPPI is investigated in a computational study.

Suggested Citation

  • Jacko, Peter & Niño Mora, José, 2009. "An index for dynamic product promotion and the knapsack problem for perishable items," DES - Working Papers. Statistics and Econometrics. WS ws093111, Universidad Carlos III de Madrid. Departamento de Estadística.
    • Handle: RePEc:cte:wsrepe:ws093111
    as

    Download full text from publisher

    File URL: https://e-archivo.uc3m.es/rest/api/core/bitstreams/7ccd83ed-29db-45a4-b1cf-c74464b87448/content
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. L L Lu & S Y Chiu & L A Cox, 1999. "Optimal project selection: Stochastic knapsack with finite time horizon," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(6), pages 645-650, June.
    2. Felipe Caro & Jérémie Gallien, 2007. "Dynamic Assortment with Demand Learning for Seasonal Consumer Goods," Management Science, INFORMS, vol. 53(2), pages 276-292, February.
    3. Katia Campo & Els Gijsbrechts, 2005. "Retail assortment, shelf and stockout management: issues, interplay and future challenges," Applied Stochastic Models in Business and Industry, John Wiley & Sons, vol. 21(4‐5), pages 383-392, July.
    4. Dimitris Bertsimas & Adam J. Mersereau, 2007. "A Learning Approach for Interactive Marketing to a Customer Segment," Operations Research, INFORMS, vol. 55(6), pages 1120-1135, December.
    5. Jason D. Papastavrou & Srikanth Rajagopalan & Anton J. Kleywegt, 1996. "The Dynamic and Stochastic Knapsack Problem with Deadlines," Management Science, INFORMS, vol. 42(12), pages 1706-1718, December.
    6. José Niño-Mora, 2007. "Dynamic priority allocation via restless bandit marginal productivity indices," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(2), pages 161-198, December.
    7. Wedad Elmaghraby & P{i}nar Keskinocak, 2003. "Dynamic Pricing in the Presence of Inventory Considerations: Research Overview, Current Practices, and Future Directions," Management Science, INFORMS, vol. 49(10), pages 1287-1309, October.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Santiago R. Balseiro & David B. Brown & Chen Chen, 2021. "Dynamic Pricing of Relocating Resources in Large Networks," Management Science, INFORMS, vol. 67(7), pages 4075-4094, July.
    2. Malekipirbazari, Milad, 2025. "Optimizing sequential decision-making under risk: Strategic allocation with switching penalties," European Journal of Operational Research, Elsevier, vol. 321(1), pages 160-176.
    3. Onesun Steve Yoo & Kevin McCardle, 2020. "The Valuator’s Curse: Decision Analysis of Overvaluation and Disappointment in Acquisition," Decision Analysis, INFORMS, vol. 17(4), pages 299-313, December.
    4. Hao Zhang, 2022. "Dynamic Learning and Decision Making via Basis Weight Vectors," Operations Research, INFORMS, vol. 70(3), pages 1835-1853, May.
    5. Mantrala, Murali K. & Levy, Michael & Kahn, Barbara E. & Fox, Edward J. & Gaidarev, Peter & Dankworth, Bill & Shah, Denish, 2009. "Why is Assortment Planning so Difficult for Retailers? A Framework and Research Agenda," Journal of Retailing, Elsevier, vol. 85(1), pages 71-83.
    6. Tianke Feng & Joseph C. Hartman, 2015. "The dynamic and stochastic knapsack Problem with homogeneous‐sized items and postponement options," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(4), pages 267-292, June.
    7. Alexander G. Nikolaev & Sheldon H. Jacobson, 2010. "Technical Note ---Stochastic Sequential Decision-Making with a Random Number of Jobs," Operations Research, INFORMS, vol. 58(4-part-1), pages 1023-1027, August.
    8. David B. Brown & James E. Smith, 2025. "Unit Commitment Without Commitment: A Dynamic Programming Approach for Managing an Integrated Energy System Under Uncertainty," Operations Research, INFORMS, vol. 73(4), pages 1744-1766, July.
    9. Vivek F. Farias & Ritesh Madan, 2011. "The Irrevocable Multiarmed Bandit Problem," Operations Research, INFORMS, vol. 59(2), pages 383-399, April.
    10. Nathan C. Craig & Ananth Raman, 2016. "Improving Store Liquidation," Manufacturing & Service Operations Management, INFORMS, vol. 18(1), pages 89-103, February.
    11. Ahuja, Vishal & Birge, John R., 2016. "Response-adaptive designs for clinical trials: Simultaneous learning from multiple patients," European Journal of Operational Research, Elsevier, vol. 248(2), pages 619-633.
    12. David B. Brown & Jingwei Zhang, 2025. "Fluid Policies, Reoptimization, and Performance Guarantees in Dynamic Resource Allocation," Operations Research, INFORMS, vol. 73(2), pages 1029-1045, March.
    13. David B. Brown & Jingwei Zhang, 2023. "Technical Note—On the Strength of Relaxations of Weakly Coupled Stochastic Dynamic Programs," Operations Research, INFORMS, vol. 71(6), pages 2374-2389, November.
    14. Ilan Lobel, 2021. "Revenue Management and the Rise of the Algorithmic Economy," Management Science, INFORMS, vol. 67(9), pages 5389-5398, September.
    15. Elodie Adida & Georgia Perakis, 2010. "Dynamic pricing and inventory control: robust vs. stochastic uncertainty models—a computational study," Annals of Operations Research, Springer, vol. 181(1), pages 125-157, December.
    16. , & , & ,, 2011. "Revenue maximization in the dynamic knapsack problem," Theoretical Economics, Econometric Society, vol. 6(2), May.
    17. Peter Jacko, 2016. "Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic," Annals of Operations Research, Springer, vol. 241(1), pages 83-107, June.
    18. David B. Brown & Jingwei Zhang, 2022. "Dynamic Programs with Shared Resources and Signals: Dynamic Fluid Policies and Asymptotic Optimality," Operations Research, INFORMS, vol. 70(5), pages 3015-3033, September.
    19. David B. Brown & James E. Smith, 2020. "Index Policies and Performance Bounds for Dynamic Selection Problems," Management Science, INFORMS, vol. 66(7), pages 3029-3050, July.
    20. Yiangos Papanastasiou & Kostas Bimpikis & Nicos Savva, 2018. "Crowdsourcing Exploration," Management Science, INFORMS, vol. 64(4), pages 1727-1746, April.

    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:cte:wsrepe:ws093111. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Ana Poveda (email available below). General contact details of provider: http://portal.uc3m.es/portal/page/portal/dpto_estadistica .

    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.