RELAXATION ALGORITHM FOR MINIMIZATION OF A QUASI-CONCAVE FUNCTION ON A CONVEX POLYHEDRON

被引：16

作者：

CARRILLO, MJ ^{[1
]}

机构：

[1] UNIV TEXAS, DALLAS, TX 75230 USA

来源：

关键词：

D O I：

10.1007/BF01584324

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：69 / 80

页数：12

共 29 条

[1]

BALI S, 1973, THESIS U CALIFORNIA

[2] AN ALGORITHM FOR FINDING ALL VERTICES OF CONVEX POLYHEDRAL SETS [J].

BALINSKI, ML .

JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1961, 9 (01) :72-88

[3] GENERATING ALL FACES OF A POLYHEDRON [J].

BURDET, CA .

CABOT, AV ;

FRANCIS, RL .

CABOT, AV .

[6]

CARVAJALMORENO R, 1972, ORC723 U CAL OP RES

[7]

Chernikova N., 1965, COMP MATH MATH PHYS+, V5, P228

[8]

Cottle R. W., 1970, Integer and nonlinear programming, P257

[9] DECOMPOSITION PRINCIPLE FOR LINEAR-PROGRAMS [J].

DANTZIG, GB ;

WOLFE, P .

[10]

Falk J. E., 1976, Mathematics of Operations Research, V1, P251, DOI 10.1287/moor.1.3.251