Global optimization of a class of nonconvex quadratically constrained quadratic programming problems |
| |
| Authors: | Yong Xia |
| |
| Institution: | LMIB of the Ministry of Education; School of Mathematics and Systems Science, Beihang University, Beijing 100191, P. R. China |
| |
| Abstract: | In this paper we study a class of nonconvex quadratically constrained quadratic programming problems generalized from relaxations
of quadratic assignment problems. We show that each problem is polynomially solved. Strong duality holds if a redundant constraint
is introduced. As an application, a new lower bound is proposed for the quadratic assignment problem. |
| |
| Keywords: | Nonconvex programming quadratically constrained quadratic programming quadratic assignment problem polynomial solvability strong duality |
| 本文献已被 维普 SpringerLink 等数据库收录！ |
