ON THE SOLUTION AND COMPLEXITY OF A GENERALIZED LINEAR COMPLEMENTARITY-PROBLEM

被引:10
|
作者
JUDICE, JJ [1 ]
VICENTE, LN [1 ]
机构
[1] UNIV COIMBRA,DEPT MATEMAT,P-3000 COIMBRA,PORTUGAL
关键词
COMPLEMENTARITY PROBLEMS; POLYNOMIAL COMPLEXITY; GLOBAL OPTIMIZATION;
D O I
10.1007/BF01099266
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
We introduce some sufficient conditions under which a generalized linear complementarity problem (GLCP) can be solved as a pure linear complementarity problem. We also establish that the GLCP is in general a NP-Hard problem.
引用
收藏
页码:415 / 424
页数:10
相关论文
共 50 条