HEURISTIC ALGORITHMS FOR CAPITAL‐BUDGETING DECISIONS IN MULTIDIVISION FIRMS
- 1 January 1980
- journal article
- Published by Wiley in Decision Sciences
- Vol. 11 (1) , 98-108
- https://doi.org/10.1111/j.1540-5915.1980.tb01128.x
Abstract
This paper presents two versions of a heuristic algorithm to solve a model of the capital‐budgeting problem in a decentralized multidivision firm involving no more than two exchanges of information between headquarters and divisions. Headquarters makes an allocation of funds to each division based upon its cash demand and its potential growth rate. Each division determines which projects to accept. Then, an additional iteration is performed to define the solution. More than one thousand examples were simulated resulting in an average relative error of less than one percent.Keywords
This publication has 6 references indexed in Scilit:
- Simulation of Decentralized Planning in Two Danish Organizations Using Linear Programming DecompositionManagement Science, 1978
- Unrecovered Investment, Uniqueness of the Internal Rate, and the Question of Project AcceptabilityJournal of Financial and Quantitative Analysis, 1977
- THE ECONOMICS OF DECOMPOSITION: RESOURCE ALLOCATION VS TRANSFER PRICINGDecision Sciences, 1974
- APPLICATION OF THE DECOMPOSITION PRINCIPLE TO THE CAPITAL BUDGETING PROBLEM IN A DECENTRALIZED FIRMThe Journal of Finance, 1974
- Application of the Decomposition Principle to the Capital Budgeting Problem in a Decentralized FirmThe Journal of Finance, 1974
- A Sufficient Condition for a Unique Nonnegative Internal Rate of Return: A CommentJournal of Financial and Quantitative Analysis, 1973