An algorithm for indefinite integer quadratic programming (Q2641219): Difference between revisions

A branch and bound method is presented for solving an indefinite integer quadratic programming problem with constraints of the form \(g_ i(x)\leq 0\), \(L_ j\leq x_ j\leq U_ j\), where the \(g_ i\) are real-valued convex functions and \(L_ j\) and \(U_ j\) are real numbers. The method is illustrated by a small example. Computational results are not presented.