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 ℝn. © 2003 Elsevier B.V. All rights reserved.
Mendeley saves you time finding and organizing research
Choose a citation style from the tabs below