Abstract
We derive a new family of integer programming (IP) Farkas’ lemmas based on superadditive duality. We construct a certificate of infeasibility for an IP as a function of its right-hand side. We develop a recursive approach to compute such a function.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
