D6 - Maximize nX j=1 c jxj, subject to: nX j=1 ai j x j _...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Maximize nX j=1 c jxj, subject to: nX j=1 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 availability bi of any resource. One important special scenario for the capital-budgeting problem involves cash-flow constraints. In this case, the constraints nX j=1 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.

Ask a homework question - tutors are online