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

来源：

JOURNAL OF GLOBAL OPTIMIZATION | 1994年 / 4卷 / 04期

关键词：

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

共 11 条

[1] NP-COMPLETENESS OF THE LINEAR COMPLEMENTARITY-PROBLEM [J].

CHUNG, SJ .

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1989, 60 (03) :393-399

[2]

Cottle, 1992, LINEAR COMPLEMENTARI

[3] SUFFICIENT MATRICES AND THE LINEAR COMPLEMENTARITY-PROBLEM [J].

COTTLE, RW ;

PANG, JS ;

VENKATESWARAN, V .

LINEAR ALGEBRA AND ITS APPLICATIONS, 1989, 114 :231-249

[4] REFORMULATION OF MATHEMATICAL-PROGRAMMING PROBLEMS AS LINEAR COMPLEMENTARITY-PROBLEMS AND INVESTIGATION OF THEIR SOLUTION METHODS [J].

JUDICE, JJ ;

MITRA, G .

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1988, 57 (01) :123-149

[5] A COMPUTATIONAL ANALYSIS OF LCP METHODS FOR BILINEAR AND CONCAVE QUADRATIC-PROGRAMMING [J].

JUDICE, JJ ;

FAUSTINO, AM .

COMPUTERS & OPERATIONS RESEARCH, 1991, 18 (08) :645-654

[6]

Karp R.M., 1972, COMPLEXITY COMPUTER, P85

[7] AN O(SQUARE-ROOT-N L) ITERATION POTENTIAL REDUCTION ALGORITHM FOR LINEAR COMPLEMENTARITY-PROBLEMS [J].

KOJIMA, M ;

MIZUNO, S ;

YOSHISE, A .

MATHEMATICAL PROGRAMMING, 1991, 50 (03) :331-342

[8] MAXIMIZATION OF A CONVEX QUADRATIC FUNCTION UNDER LINEAR CONSTRAINTS [J].

KONNO, H .

MATHEMATICAL PROGRAMMING, 1976, 11 (02) :117-127

[9]

PARDALOS PM, 1987, LECTURE NOTES COMPUT, V268

[10]

YE Y, 1989, U IOWA WORKING PAPER, V9010

← 1 2 →