Optimization
Optimization problems, convex relaxations and duality.
| Entry | Formal results | Status |
|---|---|---|
| A Lagrangian duality gap that survives closed convexification | 1 | checked |
| LP hardness of approximation for polynomial-time solvable problems | 23 | checked |
| Nonnegative rank of the spanning-tree slack matrix | 3 | checked |