2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/130543We construct examples of contingency tables on $n$ binary random variables where the gap between the linear programming lower/upper bound and the true integer lower/upper bounds on cell entries is exponentially large. These examples provide evidence that linear programming may not be an effective heuristic for detecting disclosures when releasing margins of multi-way tables.6 pagesOptimization and ControlCommutative AlgebraStatistics Theorytext