a $0-1$ integer programming model, if the constraint $x_1-x_2=0,$ it means when project $1$ is elected, project $2$ be selected.

A$)$ can sometimes

B$)$ can never

C$)$ can also

D$)$ must also