← Back to Handbooks

Capital Budgeting - Handbook

Type: BIP (Binary Integer Programming)

This handbook explains the Capital Budgeting sample problem in the LP Black Box platform.

This is a classic investment selection problem where you must choose which projects to fund.


The Problem

Scenario

A company has $100 million to invest in 5 potential projects. Each project requires a certain investment and provides a certain return.

ProjectInvestment ($M)Return ($M)NPV Value ($M)
Project A304515
Project B253510
Project C406020
Project D15227
Project E507020

Budget: $100 million

Your Goal

Maximize total NPV (Net Present Value) while staying within budget.

The Key: Binary Variables

Each project is either:

This is why we use Binary variable type - you can only choose 0 or 1, not partial investments.

The Variables

VariableTypeMeaning
projABinary (0 or 1)Is Project A funded?
projBBinary (0 or 1)Is Project B funded?
projCBinary (0 or 1)Is Project C funded?
projDBinary (0 or 1)Is Project D funded?
projEBinary (0 or 1)Is Project E funded?

The Constraints

  1. Budget: Total investment cannot exceed $100M

    Formula: 30×projA + 25×projB + 40×projC + 15×projD + 50×projE ≤ 100

  2. Minimum Projects: Must fund at least 3 projects

    Formula: projA + projB + projC + projD + projE ≥ 3

  3. Mutual Exclusion: Cannot fund both Project C and Project E together

    Formula: projC + projE ≤ 1


How to Use

Step 1: Load the Sample

Select Capital Budgeting from the dropdown.

Step 2: Solve

The solver determines which projects to fund for maximum NPV within budget.

Step 3: Interpret Results

The solution will show:


Try It Yourself


Real-World Applications


This demonstrates how Binary Integer Programming solves selection problems where you must choose discrete "yes/no" options.