Assume that we are using $0-1$ integer programming model to solve a capital budgeting problem

and $x_j=1$ if project $j$ is selected and $x_j=0,$ otherwise.

The constraint $(x1+x2+x3+x4=1)$ means that

selected.

A$)$ exactly $1,4$

B$)$ exactly $2,4$

B$)$ exactly $2,4$

C$)$ at most $1,2$

projects must be

D$)$ exactly $1,2$

Assume that we are using $0-1$ integer programming model to solve a capital budgeting problem

and $x_j=1$ if project $j$ is selected and $x_j=0,$ otherwise.

The constraint $(x1+x2+x3+x41)$ means that

selected.

A$)$ at least $1,4$

B$)$ at most $1,4$

projects can be

C$)$ exactly $1,4$

D$)$ exactly $2,4$