Another Proof of the Fact that Polyhedral Cones are Finitely Generated
Combinatorics
2009-12-16 v1 Optimization and Control
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.
Cite
@article{arxiv.0912.2927,
title = {Another Proof of the Fact that Polyhedral Cones are Finitely Generated},
author = {Volker Kaibel},
journal= {arXiv preprint arXiv:0912.2927},
year = {2009}
}
Comments
5 pages, 3 figures