Hilbert basis (linear programming): Difference between revisions

Content deleted Content added
Citation bot (talk | contribs)
m Citation maintenance. Removed redundant parameters. You can use this bot yourself! Please report any bugs.
cone basis
Line 1:
In [[linear programming]], a '''Hilbert basis''' for a [[convex cone]] is aan integer [[cone basis]]: minimal set of integer vectors such that every integer vector in the convex cone is a [[linear combination]] of the vectors in the Hilbert basis with non-negative integer coefficients.
 
More precisely, a set <math>\{a_1,\ldots,a_n\}</math> of integer vectors is a Hilbert basis if