Abstract
Graver's optimality conditions based on Hilbert bases apply to an integer program with linear equations and a linear objective function. We generalize this result to include a fairly large class of nonlinear objective functions. Our extension provides in particular a link between the superadditivity of the difference-objective function and the Hilbert bases of conic subpartitions of R n .
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
