A Myopic Capital Budgeting Model

The classic 1955 paper of Lorie and Savage has stimulated the development of mathematical programming approaches to the analysis of capital budgeting problems. A problem that they considered has been succinctly stated as: given the net present value of a set of independent investment alternatives, and given the required outlays for the projects in each of two time periods, find the subset of projects which maximizes the total net present value of the accepted ones while simultaneously satisfying a constraint on the outlays in each of the two periods.

[1]  A. S. Manne.  Optimal Dividend and Investment Policies for a Self-Financing Business Enterprise , 1968 .

[2]  A. M. Geoffrion.  Integer Programming by Implicit Enumeration and Balas’ Method , 1967 .

[3]  Anthony V. Fiacco,et al.  Nonlinear programming;: Sequential unconstrained minimization techniques , 1968 .

[4]  P. Kolesar.  A Branch and Bound Algorithm for the Knapsack Problem , 1967 .

[5]  E. L. Lawler,et al.  Branch-and-Bound Methods: A Survey , 1966, Oper. Res..

[6]  J. Fred Weston,et al.  The Investment, Financing, and Valuation of the Corporation. , 1963 .

[7]  L. J. Savage,et al.  Three Problems in Rationing Capital , 1955 .

[8]  E. M. L. Beale,et al.  Nonlinear Programming: A Unified Approach. , 1970 .

[9]  Abraham Charnes,et al.  A Chance-Constrained Approach to Capital Budgeting with Portfolio Type Payback and Liquidity Constraints and Horizon Posture Controls , 1967, Journal of Financial and Quantitative Analysis.

[10]  A. Charnes,et al.  APPLICATION OF LINEAR PROGRAMMING TO FINANCIAL BUDGETING AND THE COSTING OF FUNDS , 1959 .

[11]  Michel Balinski,et al.  Integer Programming: Methods, Uses, Computations , 1965 .

[12]  Richard H. Bernhard.  Mathematical Programming Models for Capital Budgeting—A Survey, Generalization, and Critique , 1969 .

[13]  Seymour Kaplan.  Solution of the Lorie-Savage and Similar Integer Programming Problems by the Generalized Lagrange Multiplier Method , 1966, Oper. Res..

[14]  R. J. Dakin,et al.  A tree-search algorithm for mixed integer programming problems , 1965, Comput. J..

[15]  H. Weingartner,et al.  Mathematical Programming and the Analysis of Capital Budgeting Problems. , 1964 .

[16]  L. G. Mitten.  Branch-and-Bound Methods: General Formulation and Properties , 1970, Oper. Res..

[17]  H. Weingartner.  Capital Budgeting of Interrelated Projects: Survey and Synthesis , 1966 .

[18]  Norman J. Driebeek.  An Algorithm for the Solution of Mixed Integer Programming Problems , 1966 .

[19]  Egon Balas.  DUALITY IN DISCRETE PROGRAMMING: IV. APPLICATIONS. , 1968 .

[20]  Kurt Spielberg,et al.  Direct Search Algorithms for Zero-One and Mixed-Integer Programming , 1967, Oper. Res..

[21]  Richard E. Quandt,et al.  Investment and Discount Rates Under Capital Rationing—A Programming Approach , 1965 .

[22]  Bertil Naslund,et al.  A Model of Capital Budgeting Under Risk , 1966 .