Hilbert basis (linear programming): Difference between revisions

Revision as of 01:03, 22 July 2008

Revision as of 17:37, 22 July 2008

Line 1:

{{Wikify|date=July 2008}}

In [[linear programming]], a '''Hilbert basis''' is a minimal set of integer vectors <math>\{a_1,\ldots,a_n\}</math> such that

every integer vector in its [[convex cone]]

Line 15 ⟶ 17:

* An Integer Analogue of Carathéodory's Theorem [http://repos.project.cwi.nl:8888/cwi_repository/docs/I/10/10058A.pdf]

* A Counterexample to an Integer Analogue of Carathéodory's Theorem [http://page.mi.fu-berlin.de/~chaase/lehre/bghmw.pdf]

{{Uncategorizedstub|date=July 2008}}

{{maths-stub}}

{{uncatstub}}