Which Nonnegative Matrices Are Slack Matrices?
Optimization and Control
2013-03-25 v1
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
Cite
@article{arxiv.1303.5670,
title = {Which Nonnegative Matrices Are Slack Matrices?},
author = {João Gouveia and Roland Grappe and Volker Kaibel and Kanstantsin Pashkovich and Richard Z. Robinson and Rekha R. Thomas},
journal= {arXiv preprint arXiv:1303.5670},
year = {2013}
}
Comments
14 pages