Article ID: | iaor19992657 |
Country: | Netherlands |
Volume: | 81 |
Issue: | 3 |
Start Page Number: | 401 |
End Page Number: | 405 |
Publication Date: | May 1998 |
Journal: | Mathematical Programming |
Authors: | Scheimberg Susana, Moraes Patricia Erthal de |
A counterexample is given to show that a previously proposed sufficient condition for a local minimum of a class of nonconvex quadratic programs is not correct. This class of problems arises in combinatorial optimization. The problem with the original proof is pointed out.