A discrete Farkas lemma

DOI10.1016/j.disopt.2004.04.002zbMath1087.90051arXivmath/0303094OpenAlexW2050227231WikidataQ124850527 ScholiaQ124850527MaRDI QIDQ2386214

Jean-Bernard Lasserre

Publication date: 22 August 2005

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0303094

zbMATH Keywords

Integer programmingLinear programmingFarkas lemma

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05)

Related Items

Theorems of the alternative for conic integer programming, A discrete variant of Farkas' lemma, A discrete variant of Farkas' lemma and related results, Superadditive characterizations of pure integer programming feasibility, Integer Farkas Lemma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Frobenius problem, rational polytopes, and Fourier-Dedekind sums
• Solving the knapsack problem via \(\mathbb Z\)-transform
• A Laplace transform algorithm for the volume of a convex polytope
• The value function of an integer program
• On the linear diophantine problem of Frobenius.
• Lifting standard bases in filtered structures
• Lattice points in simple polytopes
• Residue formulae, vector partition functions and lattice points in rational polytopes
• Solving a class of multivariate integration problems via Laplace techniques
• On a linear diophantine problem of Frobenius
• On Counting Integral Points in a Convex Rational Polytope