Abstract
In this article, we obtain new sufficient optimality conditions for the nonconvex quadratic optimization problems with binary constraints by exploring local optimality conditions. The relation between the optimal solution of the problem and that of its continuous relaxation is further extended.
| Original language | English |
|---|---|
| Pages (from-to) | 253-263 |
| Number of pages | 11 |
| Journal | Optimization Letters |
| Volume | 3 |
| Issue number | 2 |
| DOIs | |
| State | Published - Mar 2009 |
Keywords
- Integer programming
- Nonconvex optimization
- Optimality conditions
- Quadratic programming
Fingerprint
Dive into the research topics of 'New optimality conditions for quadratic optimization problems with binary constraints'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver