An algorithm for indefinite integer quadratic programming (Q2641219)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm for indefinite integer quadratic programming |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for indefinite integer quadratic programming |
scientific article |
Statements
An algorithm for indefinite integer quadratic programming (English)
0 references
1991
0 references
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.
0 references
branch and bound
0 references
indefinite integer quadratic programming
0 references
