A finite test set for an integer optimization problem enables us to verify whether a feasible point attains the global optimum. We establish in this paper several general results that apply to integer optimization problems with nonlinear objective functions. Key words: Integer programming, test sets, certificates Hilbert basis, Gordan Lemma, superadditive