Small contingency tables with large gaps
Abstract
We 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 multiway tables.
 Publication:

arXiv Mathematics eprints
 Pub Date:
 May 2004
 arXiv:
 arXiv:math/0405038
 Bibcode:
 2004math......5038S
 Keywords:

 Mathematics  Optimization and Control;
 Mathematics  Commutative Algebra;
 Mathematics  Statistics
 EPrint:
 6 pages