AN INTERIOR POINT ALGORITHM FOR SEMI-INFINITE LINEAR-PROGRAMMING

被引：25

作者：

FERRIS, MC ^{[1
]}

PHILPOTT, AB ^{[1
]}

机构：

[1] UNIV CAMBRIDGE,DEPT ENGN,CAMBRIDGE,ENGLAND

来源：

MATHEMATICAL PROGRAMMING | 1989年 / 43卷 / 03期

关键词：

D O I：

10.1007/BF01582293

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 [计算机软件与理论]; 0835 [软件工程];

摘要：

引用

收藏

页码：257 / 276

页数：20

相关论文

共 11 条

[1]

ADLER I, IMPLEMENTATION KARMA

[2]

A VARIATION ON KARMARKAR ALGORITHM FOR SOLVING LINEAR-PROGRAMMING PROBLEMS [J].

BARNES, ER .

MATHEMATICAL PROGRAMMING, 1986, 36 (02) :174-182

[3]

CAVALIER TM, 1985, ISME85105 PENNS STAT

[4]

Dikin I. I., 1967, SOVIET MATH DOKLADY, V8, P674

[5]

Glashoff K, 1983, LINEAR OPTIMIZATION

[6]

GUSTAFSON SA, 1979, SEMIINFINITE PROGRAM

[7]

A NEW POLYNOMIAL-TIME ALGORITHM FOR LINEAR-PROGRAMMING [J].

KARMARKAR, N .

COMBINATORICA, 1984, 4 (04) :373-395

[8]

CONVERGENCE RESULTS AND NUMERICAL EXPERIMENTS ON A LINEAR-PROGRAMMING HYBRID ALGORITHM [J].

KORTANEK, KO ;

SHI, M .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1987, 32 (01) :47-61

[9]

KORTANEK KO, 1987, 872 U IOW COLL BUS A

[10]

Van Loan C.F., 1983, MATRIX COMPUTATIONS