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