Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
476229 | Computers & Operations Research | 2008 | 19 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Mustafa K. Atlihan, Linus Schrage,