binary quadratic mixed integer nonlinear programming to inequalities

87 Views Asked by At

I have this unconstrained z=x.y where x,y are 0-1 integers. How to reformulate that into set of mixed integer linear inequalities with exactly the same feasible region?

1

There are 1 best solutions below

2
On

If $x$ and $y$ are $1$, then $z$ has to be 1, $z \geq x+ y-1$

If $x$ and/or $y$ is $0$, then $z$ has to be 0, $z \leq x$, $z \leq y$