AN O(N3L) ALGORITHM USING A SEQUENCE FOR A LINEAR COMPLEMENTARITY-PROBLEM

被引:10
作者
MIZUNO, S [1 ]
机构
[1] TOKYO INST TECHNOL,DEPT IND ENGN & MANAGEMENT,MEGURO KU,TOKYO 152,JAPAN
关键词
D O I
10.15807/jorsj.33.66
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:66 / 75
页数:10
相关论文
共 20 条
[1]  
Cottle R. W., 1968, LINEAR ALGEBRA APPL, V1, P103, DOI DOI 10.1016/0024-3795(68)90052-9
[2]  
FREUND RM, 1988, OR18288 MIT SLOAN SC
[3]  
GONZAGA CC, 1988, PROGR MATH PROGRAMMI, P1
[4]   A Multiplicative Barrier Function Method for Linear Programming [J].
Iri, Masao ;
Imai, Hiroshi .
ALGORITHMICA, 1986, 1 (1-4) :455-482
[5]   A NEW POLYNOMIAL-TIME ALGORITHM FOR LINEAR-PROGRAMMING [J].
KARMARKAR, N .
COMBINATORICA, 1984, 4 (04) :373-395
[6]   A POLYNOMIAL-TIME ALGORITHM FOR A CLASS OF LINEAR COMPLEMENTARITY-PROBLEMS [J].
KOJIMA, M ;
MIZUNO, S ;
YOSHISE, A .
MATHEMATICAL PROGRAMMING, 1989, 44 (01) :1-26
[7]  
KOJIMA M., 1988, PROGR MATH PROGRAMMI, P29
[8]  
KOJIMA M., 1988, B217 TOK I TECHN DEP
[9]   BIMATRIX EQUILIBRIUM POINTS AND MATHEMATICAL-PROGRAMMING [J].
LEMKE, CE .
MANAGEMENT SCIENCE, 1965, 11 (07) :681-689
[10]  
Megiddo N., 1988, PROGR MATH PROGRAMMI, P131