IDEAS home Printed from https://ideas.repec.org/p/ags/harcia/294534.html
   My bibliography  Save this paper

Branch and Bound Algorithms for Investment Planning Problems

Author

Listed:
  • Kendrick, David

Abstract

As shown by Manne and Vietorisz (1963) investment planning problems involving economies of scale and/or indivisibilities are ccnviently stated as zero-one mixed integer, programming. This paper presents the results of experimentation by Martin Weitzman, Ronald Davis., and the author on the development of an efficient branch and bound algorithm for the solution of zero-one mixed integer programming problems. Two classes of algorithms (which are by no means mutually exclusive) are discussed (1) those for finding optimum solutions and 2) those for finding "good" solutions. The latter class of algorithms are included in the discussion since it is frequently prohibitively expensive to find the optimum solution to such problems and the formulator of the problem is content to have a solution which is with a known percentage of the optimum. Algorithms of the first class which are discussed are (1) Healy (1964), (2) Driebeek (1966) and (3) Davis, Kendrick, and Weitzman (1967). Within the second class two subgroups of - algorithms are discussed; those which provide upper bounds on minimization problems, [(1) Round-off solutions, (2) "Driebeek" round-off solutions, and (3) Kendrick-Weitzman solutions]; and those which provide lower bounds, riiealy solutions].

Suggested Citation

  • Kendrick, David, 1967. "Branch and Bound Algorithms for Investment Planning Problems," Center for International Affairs (CIA) Archive 294534, Harvard University, Center for International Affairs.
    • Handle: RePEc:ags:harcia:294534
    DOI: 10.22004/ag.econ.294534
    as

    Download full text from publisher

    File URL: https://ageconsearch.umn.edu/record/294534/files/harvard080.pdf
    Download Restriction: no
    File URL: https://libkey.io/10.22004/ag.econ.294534?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
    ---><---

    More about this item

    Keywords

    Research Methods/ Statistical Methods;

    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:ags:harcia:294534. 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: AgEcon Search (email available below). General contact details of provider: https://edirc.repec.org/data/wcharus.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.