Which nonnegative matrices are slack matrices?
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.
Bibliographic Details
| Main Author: |
Gouveia, João
(author) |
|---|
| Other Authors: |
Grappe, Roland
(author),
Kaibel, Volker
(author),
Pashkovich, Kanstantsin
(author),
Robinson, Richard Z.
(author),
Thomas, Rekha R.
(author) |
|---|
| Format: | article
|
|---|
| Language: | eng |
|---|
| Published: |
2013
|
|---|
| Online Access: | http://hdl.handle.net/10316/44193
|
|---|
| Country: | Portugal
|
|---|
| Oai: | oai:estudogeral.sib.uc.pt:10316/44193 |
|---|