Question: Assume that we are using 0-1 integer programming model to solve a capital budgeting problem and xj= 1 if project j is selected and xj=
Assume that we are using 0-1 integer programming model to solve a capital budgeting problem and xj= 1 if project j is selected and xj= 0, otherwise.
The constraint (x1 + x2 + x3 + x4 2) means that __________ out of the 4 projects must be selected.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
