On Test Sets for Nonlinear Integer Maximization

Jon Lee (jonleeus.ibm.com)
Shmuel Onn (onnie.technion.ac.il)
Robert Weismantel (weismantelimo.math.uni-magdeburg.de)

Abstract: A finite test set for an integer maximization problem enables us to verify whether a feasible point attains the global maximum. We establish in this paper several general results that apply to integer maximization problems with nonlinear objective functions.

Keywords: Integer programming, test set, certificate, Hilbert basis, Gordan Lemma, superadditive

Category 1: Integer Programming ((Mixed) Integer Nonlinear Programming )

Citation: Operations Research Letters 36 (2008) 439–443

Download: [PDF]

Entry Submitted: 08/15/2007
Entry Accepted: 08/15/2007
Entry Last Modified: 07/09/2008

Modify/Update this entry