On boundedness of (quasi-)convex integer optimization problems (Q999128)

The author considers the boundedness and the existence of optimal solutions for the nonlinear integer program \[ \min \{f_0(x)~|~f_i(x)\leq 0, 1 \leq i \leq m; x ~\text{integral}\}\tag{1} \] where the functions \(f_i\), \(0 \leq i \leq m\), are either \textit{faithfully convex} or quasi-convex polynomials with integer coefficients and unbounded level sets. The boundedness of (1) can be checked by a polynomial-time algorithm which is an adaption of the algorithm in [Comput. Optim. Appl. 33, No. 2--3, 349--364 (2006; Zbl 1111.90084)]. Moreover, several results concerning the existence of an optimal solution are provided.