I am trying to linearize the following logical expression without using any auxiliary binary variables, and I am interested in knowing if there is a way to do that.
$$ (x = y) \implies (b = 1) $$
where $x$, $y$ are positive variables with a known $LB$ and $UB$, and $b$ is binary. It can be easily rewritten as:
$$ (b = 0) \implies ((x \geq y + \epsilon) \ \lor \ (x \leq y - \epsilon)) \quad (1)$$ $$ (b = 0) \implies (z_1 \implies (x \geq y + \epsilon) \ \lor \ z_2 \implies (x \leq y - \epsilon)) \quad (2)$$ $$ \{(z_1 + z_2 + b \geq 1), (x \geq (y+\epsilon)-M(1-z_1)), (x \leq (y-\epsilon)+M(1-z_2)) \} \quad (3)$$
As far as I know, the DNF in the RHS of the $(1)$ needs auxiliary binary variables to linearize, and I want to know if it is possible to use only $b$ to linearize that.