  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 multi-way tables.
