We pursue the comparison between linear and integer programming from a duality point of view, and in this chapter, we provide a discrete analogue of the celebrated Farkas lemma in linear algebra.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2009 Springer-Verlag New York
About this chapter
Cite this chapter
Lasserre, JB. (2009). A Discrete Farkas Lemma. In: Linear and Integer Programming vs Linear Integration and Counting. Springer Series in Operations Research and Financial Engineering. Springer, New York, NY. https://doi.org/10.1007/978-0-387-09414-4_8
Download citation
DOI: https://doi.org/10.1007/978-0-387-09414-4_8
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-09413-7
Online ISBN: 978-0-387-09414-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)