Question $3(2$ points$)$

Consider the following $0-1$ integer programming problem:

Minimize $20x+36Y+24Z$

Subject $to$: $2x+4Y+3Z7$

$,12x+8Y+10Z25$

$,x,Y,Z$ must $be0or1$

If we wish to add the constraint that $x$ must be positive, and that only $Y$ or $Z,$ but not both, can be positive, how would the additional constraint$($s$)$ be written?

$x+Y+Z3,Y+Z1$

$x2,$ and $Y2,$ and $Z2$

$x=1,Y+Z1$

$x1,Y+Z=1$