This preview shows page 1. Sign up to view the full content.
Unformatted text preview: Maximize
c jxj, subject to:
ai j x j _ bi (i = 1, 2, . . . ,m),
x j = 0 or 1 ( j = 1, 2, . . . , n).
The objective is to maximize total contribution from all investments without exceeding the limited
bi of any resource.
One important special scenario for the capital-budgeting problem involves cash-flow constraints. In this
case, the constraints
ai j xi _ bi ...
View Full Document
This note was uploaded on 10/15/2011 for the course MBAHRM 565 taught by Professor Profbhattacharya during the Spring '11 term at IIT Kanpur.
- Spring '11