Small contingency tables with large gaps
arXiv:math/0405038
Abstract
We construct examples of contingency tables on 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 pages