Identifying Minimally Infeasible Subsystems of Inequalities
Published Online:1 Feb 1990https://doi.org/10.1287/ijoc.2.1.61
Abstract
Given an infeasible system of linear inequalities, we show that the problem of identifying all minimally infeasible subsystems can be reduced to the problem of finding all vertices of a related polyhedron. This results in a shorter enumeration than that performed by previous method to solve this problem.
INFORMS Journal on Computing, ISSN 1091-9856, was published as ORSA Journal on Computing from 1989 to 1995 under ISSN 0899-1499.
