Formulate the problem of placing n + 1 balls in n boxes as a binary integer program. Each ball must have a box, and for every box and every pair of balls at most one them can get into the box. Argue that this problem has an empty feasible region. Also show that the LP relaxation with {0, 1} \ rightarrow [0, 1] has a nonempty feasible region