Advanced Search
MyIDEAS: Login to save this article or follow this journal

The Dynamic and Stochastic Knapsack Problem with Deadlines

Contents:

Author Info

  • Jason D. Papastavrou

    (School of Industrial Engineering, Purdue University, West Lafayette, Indiana 47907-1287)

  • Srikanth Rajagopalan

    (School of Industrial Engineering, Purdue University, West Lafayette, Indiana 47907-1287)

  • Anton J. Kleywegt

    (School of Industrial Engineering, Purdue University, West Lafayette, Indiana 47907-1287)

Registered author(s):

    Abstract

    In this paper a dynamic and stochastic model of the well-known knapsack problem is developed and analyzed. The problem is motivated by a wide variety of real-world applications. Objects of random weight and reward arrive according to a stochastic process in time. The weights and rewards associated with the objects are distributed according to a known probability distribution. Each object can either be accepted to be loaded into the knapsack, of known weight capacity, or be rejected. The objective is to determine the optimal policy for loading the knapsack within a fixed time horizon so as to maximize the expected accumulated reward. The optimal decision rules are derived and are shown to exhibit surprising behavior in some cases. It is also shown that if the distribution of the weights is concave, then the decision rules behave according to intuition.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://dx.doi.org/10.1287/mnsc.42.12.1706
    Download Restriction: no

    Bibliographic Info

    Article provided by INFORMS in its journal Management Science.

    Volume (Year): 42 (1996)
    Issue (Month): 12 (December)
    Pages: 1706-1718

    as in new window
    Handle: RePEc:inm:ormnsc:v:42:y:1996:i:12:p:1706-1718

    Contact details of provider:
    Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA
    Phone: +1-443-757-3500
    Fax: 443-757-3515
    Email:
    Web page: http://www.informs.org/
    More information through EDIRC

    Related research

    Keywords: dynamic programming; sequential stochastic resource allocation;

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

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

    Cited by:
    1. Peter Jacko & Jose Nino-MOra, 2009. "An index for dynamic product promotion and the knapsack problem for perishable items," Statistics and Econometrics Working Papers ws093111, Universidad Carlos III, Departamento de Estadística y Econometría.
    2. Moldovanu, Benny & Dizdar, Deniz & Gershkov, Alex, 2011. "Revenue maximization in the dynamic knapsack problem," Theoretical Economics, Econometric Society, vol. 6(2), May.
    3. Pak, K. & Dekker, R., 2004. "Cargo Revenue Management: Bid-Prices for a 0-1 Multi Knapsack Problem," ERIM Report Series Research in Management ERS-2004-055-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus Uni.
    4. Florian Zettelmeyer & Fiona Scott Morton & Jorge Silva-Risso, 2006. "Scarcity Rents in Car Retailing: Evidence from Inventory Fluctuations at Dealerships," NBER Working Papers 12177, National Bureau of Economic Research, Inc.
    5. Kang, Seungmo & Ouyang, Yanfeng, 2011. "The traveling purchaser problem with stochastic prices: Exact and approximate algorithms," European Journal of Operational Research, Elsevier, vol. 209(3), pages 265-272, March.
    6. Chiang, David Ming-Huang & Wu, Andy Wei-Di, 2011. "Discrete-order admission ATP model with joint effect of margin and order size in a MTO environment," International Journal of Production Economics, Elsevier, vol. 133(2), pages 761-775, October.
    7. Zettelmeyer, Florian & Scott Morton, Fiona & Silva-Risso, Jorge, 2005. "Inventory Fluctuations and Price Discrimination: The Determinants of Price Variation in Car Retailing," Department of Economics, Working Paper Series qt6pf5s593, Department of Economics, Institute for Business and Economic Research, UC Berkeley.
    8. Grace Lin & Yingdong Lu & David Yao, 2007. "Stochastic Knapsack Problem Revisited: Switch-Over Policies and Dynamic Pricing," Papers 0708.1146, arXiv.org.
    9. Kraft, Edwin R., 2002. "Scheduling railway freight delivery appointments using a bid price approach," Transportation Research Part A: Policy and Practice, Elsevier, vol. 36(2), pages 145-165, February.
    10. Wang, Xiubin & Regan, Amelia, 2006. "Dynamic yield management when aircraft assignments are subject to swap," Transportation Research Part B: Methodological, Elsevier, vol. 40(7), pages 563-576, August.

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:42:y:1996:i:12:p:1706-1718. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc).

    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 references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.