Optimization Online


On Test Sets for Nonlinear Integer Maximization

Jon Lee (jonlee***at***us.ibm.com)
Shmuel Onn (onn***at***ie.technion.ac.il)
Robert Weismantel (weismantel***at***imo.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) 439443

Download: [PDF]

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

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society