CHECKING LOCAL OPTIMALITY IN CONSTRAINED QUADRATIC-PROGRAMMING IS NP-HARD

被引：109

作者：

PARDALOS, PM

SCHNITGER, G

机构：

[1] Pennsylvania State Univ, University, Park, PA, USA, Pennsylvania State Univ, University Park, PA, USA

来源：

关键词：

D O I：

10.1016/0167-6377(88)90049-1

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

MATHEMATICAL PROGRAMMING, LINEAR

引用

页码：33 / 35

页数：3

共 8 条

[1]

[Anonymous], LINEAR NONLINEAR PRO

[2]

[Anonymous], 1971, STOC 71, DOI DOI 10.1145/800157.805047

[3]

BACHEM A, 1985, 8513 U BONN RES REP

[4]

Garey MR., 1979, COMPUTERS INTRACTABI

[5] SECOND ORDER CONDITIONS FOR CONSTRAINED MINIMA [J].

MCCORMICK, GP .

[6]

MURTY KG, 8523 U MICH DEP IND

[7]

PARDALOS PM, 1987, LECTURE NOTES COMPUT, V268

[8] THE COMPLEXITY OF ANALOG COMPUTATION [J].

VERGIS, A ;

STEIGLITZ, K ;

DICKINSON, B .