Hilbert basis (linear programming): Difference between revisions

Revision as of 05:28, 29 January 2013

Revision as of 05:20, 6 March 2013

Line 1:

In [[linear programming]], a '''Hilbert basis''' for a [[convex cone]] ''C'' is an integer [[cone basis]]: minimal set of integer vectors such that every integer vector in ''C'' is a [[conical combination]] of the [[vectors]]{{dn|date=March 2013}} in the Hilbert basis with integer coefficients.

== Definition ==