Abstract
In the present work, we intend to derive conditions characterizing globally optimal solutions of quadratic 0-1 programming problems. By specializing the problem of maximizing a convex quadratic function under linear constraints, we find explicit global optimality conditions for quadratic 0-1 programming problems, including necessary and sufficient conditions and some necessary conditions. We also present some global optimality conditions for the problem of minimization of half-products.
| Original language | English |
|---|---|
| Pages (from-to) | 191-206 |
| Number of pages | 16 |
| Journal | Journal of Global Optimization |
| Volume | 46 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - Feb 2010 |
| Externally published | Yes |
Keywords
- Global optimality condition
- Global optimization
- Half-products
- Quadratic 0-1 programming
- Quadratic programming
Fingerprint
Dive into the research topics of 'Global optimality conditions for quadratic 0-1 optimization problems'. Together they form a unique fingerprint.Cite this
Chen, W., & Zhang, L. (2010). Global optimality conditions for quadratic 0-1 optimization problems. Journal of Global Optimization, 46(2), 191-206. https://doi.org/10.1007/s10898-009-9416-0