Which Nonnegative Matrices Are Slack Matrices?
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). First posted on arXiv 22 Mar 2013.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 1.
1 paper.
- 2024Neural Networks and (Virtual) Extended Formulationscited by 8
- 2024Neural Networks and (Virtual) Extended Formulations5 Nov 2024