Generalized filtering algorithms for infeasibility analysis

We present generalized filtering algorithms for debugging linear, mixed integer and nonlinear infeasible programs. Given a set of constraints that are infeasible or inconsistent, we give algorithms to identify a minimal subset of these constraints that are inconsistent. The algorithms combine existing filtering algorithms with a binary-search based divide-and-conquer approach to improve search speed. We give computational results to show the speed of the algorithms on various problem types.