IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v42y1996i12p1706-1718.html
   My bibliography  Save this article

The Dynamic and Stochastic Knapsack Problem with Deadlines

Author

Listed:
  • 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)

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.

Suggested Citation

  • 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.
    • Handle: RePEc:inm:ormnsc:v:42:y:1996:i:12:p:1706-1718
    DOI: 10.1287/mnsc.42.12.1706
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.42.12.1706
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.42.12.1706?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
    ---><---

    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:inm:ormnsc:v:42:y:1996:i:12:p:1706-1718. 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 Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.