Global optimization of a quadratic function subject to a bounded mixed integer consraint set

In this paper we consider the optimization of a quadratic function subject to a linearly bounded mixed integer constraint set. We develop two types of piecewise affine convex underestimating functions for the objective function. These are used in a branch and bound algorithm for solving the original problem. We show finite convergence to a near optimal solution for this algorithm. We illustrate the algorithm with a small numerical example. Finally we discuss some modifications of the algorithm and address the question of extending the problem to include quadratic constraints.

[1]  F. Glover.  IMPROVED LINEAR INTEGER PROGRAMMING FORMULATIONS OF NONLINEAR INTEGER PROBLEMS , 1975 .

[2]  E. Balas.  Nonconvex Quadratic Programming via Generalized Polars , 1975 .

[3]  Paul F. Kough.  The Indefinite Quadratic Programming Problem , 1979, Oper. Res..

[4]  Egon Balas,et al.  The perfectly matchable subgraph polytope of a bipartite graph , 1983, Networks.

[5]  James E. Falk,et al.  Jointly Constrained Biconvex Programming , 1983, Math. Oper. Res..

[6]  Rafael Lazimy,et al.  Improved algorithm for mixed-integer quadratic programs and a computational study , 1985, Math. Program..

[7]  Warren P. Adams,et al.  A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems , 1986 .

[8]  K. Grasse,et al.  A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization , 1986 .

[9]  Panos M. Pardalos,et al.  Constrained Global Optimization: Algorithms and Applications , 1987, Lecture Notes in Computer Science.

[10]  Egon Balas.  The Assignable Subgraph Polytope of a Directed Graph. , 1987 .

[11]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

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

[13]  Egon Balas,et al.  The perfectly Matchable Subgraph Polytope of an arbitrary graph , 1989, Comb..

[14]  Warren P. Adams,et al.  A hierarchy of relaxation between the continuous and convex hull representations , 1990 .

[15]  F. Al-Khayyal.  Jointly constrained bilinear programs and related problems: an overview , 1990 .

[16]  S. Selcuk Erenguc,et al.  An algorithm for indefinite integer quadratic programming , 1991 .