# KKT conditions analysis for binary constraints

I am wondering if boolean constraints in a linear program can be solved (after linear relaxation from $$x\in\{0,1\}$$ to both $$x\ge0$$ and $$x\le1$$) using KKT analysis.

Most of the algorithms that I have found were branch and bound-based, but I am trying to find an analytical solution using KKT conditions.

• For almost all LPs (and MIPs) there are no analytical solutions. Jun 28 at 11:33