IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v38y1990i5p820-825.html
   My bibliography  Save this article

Risk Criteria in a Stochastic Knapsack Problem

Author

Listed:
  • Mordechai I. Henig

    (Tel-Aviv University, Tel-Aviv, Israel)

Abstract

We consider an investor who wants to allocate funds among several projects. Each project is expected to yield a certain reward, and the objective is that a total reward will achieve a certain given amount, called the target. This problem is relatively easy to solve when rewards are deterministic, but may be hard in a more realistic setting when the rewards are stochastic and the investor wants to maximize the probability of attaining the target. We show that, by combining dynamic programming with a search procedure, the stochastic version of the problem can be solved relatively fast when rewards are normally distributed. The procedure is also useful for other risk criteria, which involve both the mean and the variance of the total reward.

Suggested Citation

  • Mordechai I. Henig, 1990. "Risk Criteria in a Stochastic Knapsack Problem," Operations Research, INFORMS, vol. 38(5), pages 820-825, October.
  • Handle: RePEc:inm:oropre:v:38:y:1990:i:5:p:820-825
    DOI: 10.1287/opre.38.5.820
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.38.5.820
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.38.5.820?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
    ---><---

    Citations

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


    Cited by:

    1. Yasemin Merzifonluoglu & Joseph Geunes, 2021. "The Risk-Averse Static Stochastic Knapsack Problem," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 931-948, July.
    2. S Das & D Ghosh, 2003. "Binary knapsack problems with random budgets," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(9), pages 970-983, September.
    3. Chernonog, Tatyana & Avinadav, Tal, 2014. "Profit criteria involving risk in price setting of virtual products," European Journal of Operational Research, Elsevier, vol. 236(1), pages 351-360.
    4. Asaf Levin & Aleksander Vainer, 2018. "Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem," Journal of Combinatorial Optimization, Springer, vol. 35(3), pages 794-813, April.
    5. Range, Troels Martin & Kozlowski, Dawid & Petersen, Niels Chr., 2017. "A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs," Discussion Papers on Economics 9/2017, University of Southern Denmark, Department of Economics.
    6. Brian C. Dean & Michel X. Goemans & Jan Vondrák, 2008. "Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity," Mathematics of Operations Research, INFORMS, vol. 33(4), pages 945-964, November.
    7. Nicholas G. Hall & Daniel Zhuoyu Long & Jin Qi & Melvyn Sim, 2015. "Managing Underperformance Risk in Project Portfolio Selection," Operations Research, INFORMS, vol. 63(3), pages 660-675, June.
    8. Perboli, Guido & Tadei, Roberto & Gobbato, Luca, 2014. "The Multi-Handler Knapsack Problem under Uncertainty," European Journal of Operational Research, Elsevier, vol. 236(3), pages 1000-1007.
    9. Wang, Xin & Kuo, Yong-Hong & Shen, Houcai & Zhang, Lianmin, 2021. "Target-oriented robust location–transportation problem with service-level measure," Transportation Research Part B: Methodological, Elsevier, vol. 153(C), pages 1-20.
    10. Taylan İlhan & Seyed M. R. Iravani & Mark S. Daskin, 2011. "TECHNICAL NOTE---The Adaptive Knapsack Problem with Stochastic Rewards," Operations Research, INFORMS, vol. 59(1), pages 242-248, February.
    11. Murthy, Ishwar & Sarkar, Sumit, 1997. "Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function," European Journal of Operational Research, Elsevier, vol. 103(1), pages 209-229, November.
    12. Astrid S. Kenyon & David P. Morton, 2003. "Stochastic Vehicle Routing with Random Travel Times," Transportation Science, INFORMS, vol. 37(1), pages 69-82, February.
    13. Sam Ransbotham & Ishwar Murthy & Sabyasachi Mitra & Sridhar Narasimhan, 2011. "Sequential Grid Computing: Models and Computational Experiments," INFORMS Journal on Computing, INFORMS, vol. 23(2), pages 174-188, May.
    14. Jian Li & Amol Deshpande, 2019. "Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems," Mathematics of Operations Research, INFORMS, vol. 44(1), pages 354-375, February.
    15. Stefanie Kosuch & Abdel Lisser, 2010. "Upper bounds for the 0-1 stochastic knapsack problem and a B&B algorithm," Annals of Operations Research, Springer, vol. 176(1), pages 77-93, April.
    16. João Claro & Jorge Sousa, 2010. "A multiobjective metaheuristic for a mean-risk static stochastic knapsack problem," Computational Optimization and Applications, Springer, vol. 46(3), pages 427-450, July.

    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:oropre:v:38:y:1990:i:5:p:820-825. 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.