A POLYNOMIAL-TIME ALGORITHM FOR A CLASS OF LINEAR COMPLEMENTARITY-PROBLEMS

被引:266
作者
KOJIMA, M [1 ]
MIZUNO, S [1 ]
YOSHISE, A [1 ]
机构
[1] TOKYO INST TECHNOL,DEPT IND ENGN & MANAGEMENT,MEGURO KU,TOKYO 152,JAPAN
关键词
D O I
10.1007/BF01587074
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
引用
收藏
页码:1 / 26
页数:26
相关论文
共 27 条
[1]   COMPUTATIONAL-COMPLEXITY OF VANDERHEYDEN VARIABLE DIMENSION ALGORITHM AND DANTZIG-COTTLE PRINCIPAL PIVOTING METHOD FOR SOLVING LCPS [J].
BIRGE, JR ;
GANA, A .
MATHEMATICAL PROGRAMMING, 1983, 26 (03) :316-325
[2]  
CHUNG SJ, 1979, 792 U MICH DEP IND E
[3]  
Dantzig G.B., 1963, ORC6318 U BERK REP, P13
[4]   COMPUTATIONAL COMPLEXITY OF LCPS ASSOCIATED WITH POSITIVE DEFINITE SYMMETRIC MATRICES [J].
FATHI, Y .
MATHEMATICAL PROGRAMMING, 1979, 17 (03) :335-344
[6]   ON PROJECTED NEWTON BARRIER METHODS FOR LINEAR-PROGRAMMING AND AN EQUIVALENCE TO KARMARKAR PROJECTIVE METHOD [J].
GILL, PE ;
MURRAY, W ;
SAUNDERS, MA ;
TOMLIN, JA ;
WRIGHT, MH .
MATHEMATICAL PROGRAMMING, 1986, 36 (02) :183-209
[7]  
GONZAGA CC, 1988, IN PRESS PROGR MATH
[8]  
KAPOOR S, 1986, 18TH P ANN ACM S THE, P147
[9]   A NEW POLYNOMIAL-TIME ALGORITHM FOR LINEAR-PROGRAMMING [J].
KARMARKAR, N .
COMBINATORICA, 1984, 4 (04) :373-395
[10]  
Khachian L. G., 1979, SOV MATH DOKL, V20, P191