Let B be the set of n-dimensional binary vectors and let V be a subset of m of its elements. We give an extended formulation of the convex hull of B\V which is polynomial in n and m. In developing this result, we give a two-sided extension of a result in Laurent and Sassano (1992) for knapsack sets with superincreasing coefficients.
Citation
Technical Report, ISyE, Georgia Tech, 2012.