A recursive procedure to generate all cuts for 0-1 mixed integer programs

The authors study several ways of obtaining valid inequalities for mixed integer programs. They show how inequalities obtained from a disjunctive argument can be represented by superadditive functions and show how the superadditive inequalities relate to Gomory’s mixed integer cuts. The authors also show how all valid inequalities for mixed 0-1 programs can be generated recursively from a simple subclass of the disjunctive inequalities.