| Article ID: | iaor19971134 |
| Country: | Netherlands |
| Volume: | 69 |
| Issue: | 3 |
| Start Page Number: | 403 |
| End Page Number: | 411 |
| Publication Date: | Sep 1995 |
| Journal: | Mathematical Programming (Series A) |
| Authors: | Cao Jia-Ming |
The author earlier studies the equivalence of a class of 0-1 quadratic programs and their relaxed problems. Thus, a class of combinatorial optimization problems can be solved by solving a class of nonconvex quadratic programs. In this paper, a necessary and sufficient conditon for local minima of this class of nonconvex quadratic programs is given; this will be the foundation for study of algorithms.