Using extra dual cuts to accelerate column generation

Column generation is often used to solve models with stronger linear-programming relaxations. From the dual standpoint, column-generation processes can be viewed as cutting plane algorithms. In this paper, we present conditions under which it is possible to restrict the dual space, but still preserve the strength of the primal model and recover an optimal primal solution. We derive a family of dual cuts that are valid for the space of dual optimal solutions of the one-dimensional cutting-stock problem. These cuts correspond to extra columns in the primal model. Inserting a polynomial number of cuts of this family in the problem formulation at initialization time restricts the dual space during the entire column-generation process. Computational experiments show that this idea helps, reducing substantially the number of columns generated, the number of degenerate iterations, and the computational time.