Integer Programming in Capital Budgeting: A Note on Computational Experience

Richard H. Pettway

Journal of Financial and Quantitative Analysis, 1973, vol. 8, issue 4, 665-672

Abstract: Solving capital budgeting problems with linear and integer programming has been part of the finance literature for some time [21, 22, 23, 7, 14, and 18]. Capital budgeting problems have unique properties that distinguish them from other integer linear problems discussed in the mathematical programming literature. Capital budgeting problems generally have the following characteristics: (1) the matrix tends to be rectangular with more variables than constraints; (2) they are all maximization problems with ≤ constraints and nonnegativity conditions in the general form 0≤xi≤1 in the case of linear programming and xi = 0, 1 in the case of integer problems; and (3) there are often mutually exclusive projects among the variables. The purposes of this note are to illustrate some computational experience using existing integer algorithms to solve a set of capital budgeting problems and to begin to catalog the performance of integer codes on financial problems.

Date: 1973
References: Add references at CitEc
Citations:

Downloads: (external link)
https://www.cambridge.org/core/product/identifier/ ... type/journal_article link to article abstract page (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:cup:jfinqa:v:8:y:1973:i:04:p:665-672_01

Access Statistics for this article

More articles in Journal of Financial and Quantitative Analysis from Cambridge University Press Cambridge University Press, UPH, Shaftesbury Road, Cambridge CB2 8BS UK.
Bibliographic data for series maintained by Kirk Stebbing ().