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

Valid inequalities for mixed integer programming generated by disjunctive, split or MIR methods are equivalent. The respective inequalities as well as Gomory's mixed integer cuts can be derived from a superadditive method. In the particular case of 0-1 mixed integer programs all valid inequalities are shown to be recursively generated in finitely many steps by a special disjunctive method (called \(\mathfrak D\)-inequalities). Thus, with a suitably defined recursion, superadditive inequalities are sufficient for 0-1 mixed integer programs.