3 problems

In an ACOPF relaxation, higher-order determinant constraints provide lower bounds on power loss, while bound tightening updates the variable bounds used by the relaxation. Positive…

$N_+$-Perfect Graph Conjecture. The stable set polytope of every $N_+$-perfect graph can be described by facet-defining inequalities with near-bipartite support.

Let $p_W^*$ be the infimum of the weak measure linear program … subject to … with $\mu\in\mathcal{M}^+(T\times Y\times\gamma\mathbb{R}^m)$. Let $p_S^*$ denote the infimum of the co…