A Method of Decomposition for Integer Programs

A method of decomposing integer programs with block angular structure is presented. It is based on the notion of searching for the optimal solution to an integer program among the near-optimal solutions to its Lagrangian relaxation. An optimality theorem is obtained and a generic decomposition algorithm is presented. An application of this approach is discussed and some computational results are reported.