On boundedness of (quasi-)convex integer optimization problems

In this paper we are concerned with the problem of boundedness and the existence of optimal solutions to the constrained integer optimization problem. We present necessary and sufficient conditions for boundedness of either a faithfully convex or quasi-convex polynomial function over the feasible set contained in $${\mathbb {Z}^n}$$ , and defined by a system of faithfully convex inequality constraints and/or quasi-convex polynomial inequalities. The conditions for boundedness are provided in the form of an implementable algorithm, terminating after a finite number of iterations, showing that for the considered class of functions, the integer programming problem with nonempty feasible region is unbounded if and only if the associated continuous optimization problem is unbounded. We also prove that for a broad class of objective functions (which in particular includes polynomials with integer coefficients), an optimal solution set of the constrained integer problem is nonempty over any subset of $${\mathbb {Z}^n}$$ .

[1]  K. Schittkowski,et al.  NONLINEAR PROGRAMMING , 2022 .

[2]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[3]  R. Rockafellar.  Some Convex Programs Whose Duals Are Linearly Constrained , 1970 .

[4]  Wieslawa T. Obuchowska,et al.  Conditions for boundedness in concave programming under reverse convex and convex constraints , 2007, Math. Methods Oper. Res..

[5]  Zhi-Quan Luo,et al.  On Extensions of the Frank-Wolfe Theorems , 1999, Comput. Optim. Appl..

[6]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[7]  C. Floudas.  Nonlinear and Mixed-Integer Optimization: Fundamentals and Applications , 1995 .

[8]  B. Bank,et al.  Parametric Integer Optimization , 1988 .

[9]  Alfred Auslender,et al.  How to deal with the unbounded in optimization: Theory and algorithms , 1997, Math. Program..

[10]  Philip Wolfe,et al.  An algorithm for quadratic programming , 1956 .

[11]  W. T. Obuchowska.  Convex constrained programmes with unattained infima , 1999 .

[12]  Wieslawa T. Obuchowska,et al.  Remarks on the Analytic Centers of Convex Sets , 2004, Comput. Optim. Appl..

[13]  J. Hiriart-Urruty,et al.  Convex analysis and minimization algorithms , 1993 .

[14]  Diethard Klatte,et al.  A Frank–Wolfe Type Theorem for Convex Polynomial Programs , 2002, Comput. Optim. Appl..

[15]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[16]  M. Morari,et al.  Nonlinear parametric optimization using cylindrical algebraic decomposition , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[17]  Wieslawa T. Obuchowska.  On Generalizations of the Frank-Wolfe Theorem to Convex and Quasi-Convex Programmes , 2006, Comput. Optim. Appl..

[18]  Harvey M. Salkin,et al.  Foundations of integer programming , 1989 .