# On the Primal-Dual Geometry of Level Sets in Linear and Conic Optimization

For a conic optimization problem: minimize cx subject to Ax=b, x \in C, we present a geometric relationship between the maximum norms of the level sets of the primal and the inscribed sizes of the level sets of the dual (or the other way around).

## Citation

MIT Operations Research Center Working Paper