Question $13$

In a $0-1$ integer programming problem involving a capital budgeting application $($where $x_j=1,$ if project $j$ is selected, $x_j=0,$ otherwise$)$ the constraint $x_1-x_2$

s

$0$ implies that if project $2$ is selected, project $1$ cannot be selected.

$$ True

False