Approximate formulations for 0-1 knapsack sets

We show that for each 0<ϵ≤10<ϵ≤1 there exists an extended formulation for the knapsack problem, of size polynomial in the number of variables, whose value is at most (1+ϵ)(1+ϵ) times the value of the integer program.