Abstract The analysis of infeasible subproblems plays an important role in solving mixed integer programs (MIPs) and is implemented most major MIP solvers. There are two fundamentally different concepts to generate valid global constraints from subproblems: conflict graph dual proof analysis. While detects sets contradicting variable bounds implication graph, derives linear the LP’s unboundedne...