Abstract
Quadratic 0-1 problems with linear inequality constraints are briefly considered in this paper. Global optimality conditions for these problems, including a necessary condition and some sufficient conditions, are presented. The necessary condition is expressed without dual variables. The relations between the global optimal solutions of nonconvex quadratic 0-1 problems and the associated relaxed convex problems are also studied.
Original language | English |
---|---|
Pages (from-to) | 150-154 |
Number of pages | 5 |
Journal | Journal of Shanghai University |
Volume | 14 |
Issue number | 2 |
DOIs | |
Publication status | Published - Apr 2010 |
Externally published | Yes |
Keywords
- Convex duality
- Integer programming
- Nonconvex optimization
- Optimality condition
- Quadratic 0-1 programming