THE SIMPLEX-METHOD AS A GLOBAL OPTIMIZER - A C-PROGRAMMING PERSPECTIVE

被引：9

作者：

SNIEDOVICH, M ^{[1
]}

MACALALAG, E ^{[1
]}

FINDLAY, S ^{[1
]}

机构：

[1] UNIV MELBOURNE,DEPT MATH,PARKVILLE,VIC 3052,AUSTRALIA

来源：

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

关键词：

LINEAR PROGRAMMING; SIMPLEX METHOD; C-PROGRAMMING; COMPOSITE FUNCTIONS; GLOBAL OPTIMIZATION; DC PROBLEMS;

D O I：

10.1007/BF01096536

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 [运筹学与控制论]; 12 [管理学]; 1201 [管理科学与工程]; 1202 [工商管理学]; 120202 [企业管理];

摘要：

In this paper we give a brief account of the important role that the conventional simplex method of linear programming can play in global optimization, focusing on its collaboration with composite concave programming techniques. In particular, we demonstrate how rich and powerful the c-programming format is in cases where its parametric problem is a standard linear programming problem.

引用

页码：89 / 109

页数：21

共 21 条

[1]

Avriel M, 2003, NONLINEAR PROGRAMMIN

[2]

BAZARAA M, 1990, LINEAR PROGRAMMING N

[3]

Bazaraa M. S., 1979, NONLINEAR PROGRAMMIN

[4]

Craven B. D., 1988, FRACTIONAL PROGRAMMI

[5]

Frank M., 1956, NAV RES LOG, V3, P95, DOI 10.1002/nav.3800030109

[6]

Hillier F.S., 1990, INTRO OPERATIONS RES

[7]

Horst R., 1990, GLOBAL OPTIMIZATION

[8]

Horst R, 1991, J GLOBAL OPTIM, V1, P183

[9]

A PARAMETRIC CHARACTERIZATION AND AN EPSILON-APPROXIMATION SCHEME FOR THE MINIMIZATION OF A QUASICONCAVE PROGRAM [J].

KATOH, N ;

IBARAKI, T .

DISCRETE APPLIED MATHEMATICS, 1987, 17 (1-2) :39-66

[10]

LINEAR MULTIPLICATIVE PROGRAMMING [J].

KONNO, H ;

KUNO, T .

MATHEMATICAL PROGRAMMING, 1992, 56 (01) :51-64

← 1 2 3 →