The circle packing problem: A theoretical comparison of various convexification techniques

We consider the problem of packing a given number of congruent circles with the maximum radius in a unit square as a mathematical optimization problem. Due to the presence of non-overlapping constraints, this problem is a notoriously difficult nonconvex quadratically constrained optimization problem, which possesses many local optima. We consider several popular convexification techniques, giving rise to linear programming relaxations and semidefinite programming relaxations for the circle packing problem. We compare the strength of these relaxations theoretically, thereby proving the conjectures by Anstreicher. Our results serve as a theoretical justification for the ineffectiveness of existing machinery for convexification of non-overlapping constraints.