Rewrite: If $x_1=1$ then $x_2+x_3+x_4+x_5=0$ in linear programming if variables $x_1,x_2,x_3,x_4,x_5$ are binary?
Edit:Sorry the sum of $x_2,x_3,x_4$ and $x_5$ should equal $0$. I tried re-writing it as if the variables are non-binary am not sure of that's how it should be done
Guide:
One possible way:
If $y=0$, then we want to force $z=0$ where $y,z \in \{0,1\}$ can be achieved by $y \geq z$ since if $y=0$, we force $z=0$, and if $y=1$, we do not impose any constraint.
Given that information, you might want to solve the original problem using $4$ inequalities.
Note, it can also be solved in a single inequality but it would be great to let you attempt first.