I am currently trying to model the relationship that if the binary variables $b_{it}=0$ and $c_{it}=1$, and for the integer non-negative variable $b^{n}_{i(t-1)}=0$, then the new binary variable $a_{it}$ is equal to 1, in all other cases 0. I came up with the following constraints, but I think they are wrong.
\begin{align} &a_{it} \leq 1 - b^{n}_{i(t-1)}&&\forall i\in I, t\in \{2,...,T\}\\ &a_{it} \leq 1 - b_{it}&&\forall i\in I, t\in \{2,...,T\}\\ &a_{it} \leq c_{it}&&\forall i\in I, t\in \{2,...,T\}\\ &a_{it} \geq c_{it} + b_{it} + b^{n}_{i(t-1)} - 2&&\forall i\in I, t\in \{2,...,T\} \end{align}
For all four possible combinations, if $b^{n}_{i(t-1)}=0$, the coding works. But if, for example, $b^{n}_{i(t-1)}=2$, then the construct falls apart with constraint 1. How should I model it instead?