The integer hull of a convex rational polytope

DOI10.1007/s00454-003-0834-3zbMath1059.52021OpenAlexW2034285985MaRDI QIDQ701781

Jean-Bernard Lasserre

Publication date: 16 December 2004

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-003-0834-3

zbMATH Keywords

liftingbinomial ideallinear programinteger programdiscrete Farkas lemma

Mathematics Subject Classification ID

Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Integer programming (90C10) Linear programming (90C05)

Related Items (2)

A discrete variant of Farkas' lemma ⋮ A discrete variant of Farkas' lemma and related results

This page was built for publication: The integer hull of a convex rational polytope