Identifying Minimally Infeasible Subsystems of Inequalities
ORSA Journal on Computing · 1990 · Volume 2 · Issue 1
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.
Keywords
programming: linear
Enable JavaScript for citation tools and additional paper interactions.