Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1142851 | Operations Research Letters | 2006 | 9 Pages |
Abstract
Two methods are discussed for determining the set of all b for which the system Ax⩽b (A-constant) is irredundant. For {n=fixed,m=var} and {m-n=fixed,m=var}, the first method is of polynomial complexity and worked significantly faster. The set turns out to be a convex open unbounded polyhedron.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Ramprasad Potluri, Lawrence E. Holloway,