by Kaibel, V.
Preprint series: 11-18, Preprints
- 90C10 Integer programming
Abstract: In this note, we work out a simple inductive proof showing that every polyhedral cone K is the conic hull of a finite set X of vectors. The base cases of the induction are linear subspaces and linear halfspaces of linear subspaces. The proof also shows that the components of the vectors in X can be chosen (up to their sign) to be quotients of subdeterminants of the coefficient matrix of any inequality system defining K.
Keywords: Weyl-Minkowski Theorem, Inner and outer descriptions
The author(s) agree, that this abstract may be stored asfull text and distributed as such by abstracting services.