Portal de Periódicos da CAPES

Identifying Minimally Infeasible Subsystems of Inequalities

1990; Institute for Operations Research and the Management Sciences; Volume: 2; Issue: 1 Linguagem: Inglês

10.1287/ijoc.2.1.61

2326-3245

John Gleeson, Jennifer K. Ryan,

Advanced Algebra and Logic

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.