| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4599977 | Linear Algebra and its Applications | 2013 | 13 Pages |
Abstract
In this paper we characterize the slack matrices of cones and polytopes among all nonnegative matrices. This leads to an algorithm for deciding whether a given matrix is a slack matrix. The underlying decision problem is equivalent to the polyhedral verification problem whose complexity is unknown.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
Authors
João Gouveia, Roland Grappe, Volker Kaibel, Kanstantsin Pashkovich, Richard Z. Robinson, Rekha R. Thomas,