IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v15y1987i6p489-494.html
   My bibliography  Save this article

Application of the knapsack model for budgeting

Author

Listed:
  • Eilon, Samuel

Abstract

The budget problem of selecting projects (or activities) with known values (or payoffs) and associated costs, subject to a prescribed maximum budget, is akin to the knapsack problem, which is well documented in the literature. The optimal solution to maximise the total value of selected projects for a given budget constraint can readily be obtained. In practice, budgets are often somewhat flexible, or subject to possible changes, so that an optimal solution for a given budget value may not remain optimal when the budget is modified. It is, therefore, sensible in many situations to consider a budget range, instead of a single budget value. In addition to their original objective of maximising the total value of selected projects, decision makers are often concerned to get 'value for money', indicated by the ratio of payoff to cost. This paper examines how these questions can be tackled through the introduction of a stability index, to guide project selection within a defined budget range, and the use of a portfolio diagram, to help in the ranking of projects with respect to the stated twin objectives.

Suggested Citation

  • Eilon, Samuel, 1987. "Application of the knapsack model for budgeting," Omega, Elsevier, vol. 15(6), pages 489-494.
  • Handle: RePEc:eee:jomega:v:15:y:1987:i:6:p:489-494
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0305-0483(87)90006-5
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Baldo, Alessandro & Boffa, Matteo & Cascioli, Lorenzo & Fadda, Edoardo & Lanza, Chiara & Ravera, Arianna, 2023. "The polynomial robust knapsack problem," European Journal of Operational Research, Elsevier, vol. 305(3), pages 1424-1434.
    2. Fabrice Talla Nobibon & Roel Leus, 2014. "Complexity Results and Exact Algorithms for Robust Knapsack Problems," Journal of Optimization Theory and Applications, Springer, vol. 161(2), pages 533-552, May.
    3. Deane, Jason & Agarwal, Anurag, 2012. "Scheduling online advertisements to maximize revenue under variable display frequency," Omega, Elsevier, vol. 40(5), pages 562-570.

    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:eee:jomega:v:15:y:1987:i:6:p:489-494. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    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.