Consider a capital budgeting problem with seven projects
represented by binary (0 or 1) variables X1,
X2, X3, X4, X5,
X6, X7.
- Write a constraint modeling the situation in which only
2 of the projects from 1, 2, 3, and 4 must be
selected.
- Write a constraint modeling the situation in which at
least 2 of the project from 1, 3, 4, and 7 must be
selected.
- Write a constraint modeling the situation project 3 or
6 must be selected, but not both.
- Write a constraint modeling the situation in which at most 4
projects from the 7 can be selected.