Which Nonnegative Matrices Are Slack Matrices?
classification
🧮 math.OC
keywords
matricesslackmatrixnonnegativeproblemalgorithmcharacterizecomplexity
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.