Hilbert basis (linear programming): Difference between revisions

Revision as of 18:44, 22 March 2017

Revision as of 02:41, 29 March 2017

Line 7:

:<math>C=\{ \lambda_1 a_1 + \ldots + \lambda_n a_n \mid \lambda_1,\ldots,\lambda_n \geq 0, \lambda_1,\ldots,\lambda_n \in\mathbb{R}\}\subset\mathbb{R}^d</math>

we consider the [[monoid]] <math>C\cap L</math>. By [[Gordan's lemma]] this monoid is finetelyfinitely generated, i.e., there exists a finite set of lattice points <math>\{x_1,\ldots,x_m\}\subset C\cap L</math> such that every lattice point <math>x\in C\cap L</math> is an integer conical combination of these points:

:<math> x=\lambda_1 x_1+\ldots+\lambda_m x_m, \quad\lambda_1,\ldots,\lambda_m\in\mathbb{Z}, \lambda_1,\ldots,\lambda_m\geq0</math>