Capital Budgeting and Rationing - Theory & Concepts

Capital Budgeting and Rationing

Organizations rarely have unlimited funds to invest in every profitable opportunity. Capital Budgeting is the systematic process of planning, evaluating, and managing a firm's long-term investments. Capital Rationing specifically occurs when a firm identifies more economically acceptable independent projects than it can actually finance due to a fixed budget constraint imposed by management or the credit market.

Independent Projects vs. Mutually Exclusive Alternatives

Checklist

Mutually Exclusive Alternatives: Choosing one alternative automatically means rejecting all others. They serve the exact same function (e.g., you need to build exactly one bridge, and you must choose between a steel or a concrete design). You evaluate these using incremental analysis ( $\Delta$ IRR, $\Delta$ B/C) or by directly comparing their PW/AW over a common life.
Independent Projects: The acceptance of one project does not physically or economically preclude the acceptance of another, provided there is enough money (e.g., buying a new delivery truck and upgrading the factory HVAC system). They serve entirely different purposes.

The Capital Rationing Problem

Capital Rationing

The process of selecting a specific combination (bundle or portfolio) of independent projects that maximizes the total Present Worth (PW) added to the firm without the total initial capital investment exceeding a hard, predetermined budget limit (

b

The Flaw of Ranking

A very common intuitive heuristic is to rank all independent projects by their individual Internal Rate of Return (IRR) or Benefit-Cost (B/C) ratio, and then select projects from the top down until the budget is exhausted.

However, due to the "lumpy" or indivisible nature of capital investments, this ranking method frequently fails to yield the optimal combination. Picking the highest IRR project might consume so much budget that you cannot afford two slightly lower IRR projects that, together, would have generated a larger total Present Worth for the firm.

To guarantee the mathematically optimal solution, you must evaluate all possible bundles (combinations) of the independent projects. This converts the problem of choosing independent projects into a problem of choosing among mutually exclusive bundles.

Procedure

STEP-BY-STEP

Identify all possible bundles (combinations) of the independent projects. For $N$ independent projects, there are exactly $2^N$ possible bundles (including the "do nothing" bundle where zero projects are selected).
Eliminate infeasible bundles. Calculate the total initial investment ( $P_{total}$ ) required for each bundle. Reject any bundle where $P_{total} > \text{Budget Limit} (b)$ .
Calculate Total PW. For all remaining feasible (affordable) bundles, calculate the total Present Worth by simply summing the individual PWs of the projects contained within that bundle, evaluated at the MARR.
Select the Optimal Bundle. Choose the feasible bundle that yields the absolute highest total Present Worth.

Mathematical Formulation (Integer Linear Programming)

When an organization is dealing with dozens or hundreds of independent projects, listing all

2^N

bundles becomes computationally impossible (e.g.,

2^{30} &gt; 1

billion combinations). In these real-world scenarios, Capital Rationing is solved mathematically using Binary Integer Linear Programming (ILP).

ILP Objective Function

Let

x_j

be a binary decision variable where

x_j = 1

if project

j

is selected, and

x_j = 0

if it is rejected.

Maximize Objective:

Z = \sum_{j=1}^{N} PW_j \cdot x_j

Subject to the Budget Constraint:

\sum_{j=1}^{N} Cost_j \cdot x_j \le \text{Budget Limit}

Interactive Capital Rationing Simulator

Use the simulator below to explore how a budget constraint affects project selection. Notice how manually selecting the projects with the highest individual IRR does not always result in the highest total Present Worth for the entire portfolio compared to the exhaustive bundle search algorithm.

Capital Rationing Simulator

Total Capital Budget ($)

Independent Projects

Initial Cost ($)

Present Worth ($)

Initial Cost ($)

Present Worth ($)

Initial Cost ($)

Present Worth ($)

Optimal Feasible Bundle

Project B+Project C

Total PW Max.

$10,000

Total Cost

$45,000

Budget: $50,000

Project Selection (Cost vs PW)

Loading chart...

Selected Cost

Selected PW

Rejected

Key Takeaways

The Constraint: Capital rationing deals specifically with independent projects constrained by a strict budget limit.
The Goal: Maximize the total economic value (Total Present Worth) added to the firm without exceeding the available capital.
Bundle Analysis: The only foolproof manual way to solve a capital rationing problem is to evaluate mutually exclusive bundles (combinations) of independent projects. For $N$ projects, there are $2^N$ bundles.
The Objective Function: Always select the bundle that maximizes total PW, not total IRR.
The Heuristic Trap: Ranking projects by IRR or B/C ratio and picking down the list is fast but mathematically flawed due to the indivisibility of capital investments. It often leaves unspent budget that could have been better utilized.
Algorithmic Solution: For large project pools, Binary Integer Linear Programming (ILP) is strictly required to find the optimal portfolio.

PreviousAfter-Tax Economic Analysis - Examples & Applications

Quiz Me

NextCapital Budgeting and Rationing - Examples & Applications