论文信息 - Which nonnegative matrices are slack matrices

Which nonnegative matrices are slack matrices

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.

[1] James B. Orlin,et al. On the complexity of four polyhedral set containment problems , 2018, Math. Program..

[2] Jürgen Richter-Gebert. Realization Spaces of Polytopes , 1996 .

[3] G. E. Bredon. Topology and geometry , 1993 .

[4] H. S. M. Coxeter,et al. Vorlesungen über die Theorie der Polyeder , 1935 .

[5] A. Björner. Topological methods , 1996 .

[6] E. Steinitz,et al. Vorlesungen über die Theorie der Polyeder unter Einfluss der Elemente der Topologie , 1934 .

[7] Günter M. Ziegler,et al. Convex hulls, oracles, and homology , 2004, J. Symb. Comput..

[8] M. E. Dyer,et al. The Complexity of Vertex Enumeration Methods , 1983, Math. Oper. Res..

[9] Marc E. Pfetsch,et al. Some Algorithmic Problems in Polytope Theory , 2003, Algebra, Geometry, and Software Systems.

[10] Paul D. Seymour,et al. A Note on Hyperplane Generation , 1994, J. Comb. Theory B.

[11] T. H. Matheiss,et al. A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets , 1980, Math. Oper. Res..

[12] Mihalis Yannakakis,et al. Expressing combinatorial optimization problems by linear programs , 1991, STOC '88.

[13] Rekha R. Thomas,et al. Lifts of Convex Sets and Cone Factorizations , 2011, Math. Oper. Res..

[14] Raimund Seidel. Convex hull computations , 1997 .