THE STEEPEST DESCENT GRAVITATIONAL METHOD FOR LINEAR-PROGRAMMING

被引:10
作者
CHANG, SY [1 ]
MURTY, KG [1 ]
机构
[1] UNIV MICHIGAN,DEPT IND & OPERAT ENGN,ANN ARBOR,MI 48109
关键词
D O I
10.1016/0166-218X(89)90002-4
中图分类号
O29 [应用数学];
学科分类号
070104 [应用数学];
摘要
引用
收藏
页码:211 / 239
页数:29
相关论文
共 43 条
[1]
ADLER I, 1986, ORC868 U CAL DEP IEO
[2]
[Anonymous], [No title captured]
[3]
ANSTREICHER KM, 1987, LINEAR PROGRAMMING N
[4]
[5]
Best M. J., 1985, LINEAR PROGRAMMING
[6]
CHIU SS, 1985, SIMPLEX METHOD KARMA
[7]
Chung S.J., 1981, NONLINEAR PROGRAMMIN, V4, P439
[8]
Dantzig G.B., 1963, LINEAR PROGRAMMING
[9]
A Polynomial Newton Method for Linear Programming [J].
de Ghellinck, Guy ;
Vial, Jean-Philippe .
ALGORITHMICA, 1986, 1 (1-4) :425-453
[10]
COMPUTATIONAL COMPLEXITY OF LCPS ASSOCIATED WITH POSITIVE DEFINITE SYMMETRIC MATRICES [J].
FATHI, Y .
MATHEMATICAL PROGRAMMING, 1979, 17 (03) :335-344