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.
A company has $100 million to invest in 5 potential projects. Each project requires a certain investment and provides a certain return.
| Project | Investment ($M) | Return ($M) | NPV Value ($M) |
|---|---|---|---|
| Project A | 30 | 45 | 15 |
| Project B | 25 | 35 | 10 |
| Project C | 40 | 60 | 20 |
| Project D | 15 | 22 | 7 |
| Project E | 50 | 70 | 20 |
Budget: $100 million
Maximize total NPV (Net Present Value) while staying within budget.
Each project is either:
This is why we use Binary variable type - you can only choose 0 or 1, not partial investments.
| Variable | Type | Meaning |
|---|---|---|
| projA | Binary (0 or 1) | Is Project A funded? |
| projB | Binary (0 or 1) | Is Project B funded? |
| projC | Binary (0 or 1) | Is Project C funded? |
| projD | Binary (0 or 1) | Is Project D funded? |
| projE | Binary (0 or 1) | Is Project E funded? |
Budget: Total investment cannot exceed $100M
Formula: 30×projA + 25×projB + 40×projC + 15×projD + 50×projE ≤ 100
Minimum Projects: Must fund at least 3 projects
Formula: projA + projB + projC + projD + projE ≥ 3
Mutual Exclusion: Cannot fund both Project C and Project E together
Formula: projC + projE ≤ 1
Select Capital Budgeting from the dropdown.
The solver determines which projects to fund for maximum NPV within budget.
The solution will show:
projA = 1 means Project A is fundedprojC = 0 means Project C is not fundedThis demonstrates how Binary Integer Programming solves selection problems where you must choose discrete "yes/no" options.