New answers tagged

2 votes

Methods to solve integer linear inequalities with products of two variables

One classic technique is to reformulate the integer variables as a bunch of binary variables. In this case i would use a encoding with powers of 2 and then use a multiplier circuit to express the ...
user avatar
8 votes

Maximize correlation subject to nonconvex correlation constraints

You could add the non-convex constraint $z^Tz = 1$. That would make the objective function and other constraints linear. So this would be a Linear Programming problem, but for a single non-convex ...
user avatar

Top 50 recent answers are included