CONVERGENT ALGORITHMS FOR MINIMIZING A CONCAVE FUNCTION

被引：11

作者：

VANTHOAI, N

TUY, H

机构：

来源：

MATHEMATICS OF OPERATIONS RESEARCH | 1980年 / 5卷 / 04期

关键词：

D O I：

10.1287/moor.5.4.556

中图分类号：

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

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：556 / 566

页数：11

共 43 条

[1]

ALTMAN M, 1968, B ACAD POL SCI SMAP, V16, P741

[2] INTERSECTION CUT FROM DUAL OF UNIT HYPERCUBE [J].

BALAS, E ;

BOWMAN, VJ ;

GLOVER, F ;

SOMMER, D .

OPERATIONS RESEARCH, 1971, 19 (01) :40-+

[3] INTERSECTION CUTS - NEW TYPE OF CUTTING PLANES FOR INTEGER PROGRAMMING [J].

BALAS, E .

OPERATIONS RESEARCH, 1971, 19 (01) :19-+

[4]

BALAS E, 1973, GSIA299 CARN MELL U

[5]

BALI S, 1973, THESIS U CALIFORNIA

[6]

BULATOV VP, 1977, METODY POGRUZENYA ZA

[7] SOLVING CERTAIN NONCONVEX QUADRATIC MINIMIZATION PROBLEMS BY RANKING EXTREME POINTS [J].

CABOT, AV ;

FRANCIS, RL .

OPERATIONS RESEARCH, 1970, 18 (01) :82-&

[8] VARIATIONS ON A CUTTING PLANE METHOD FOR SOLVING CONCAVE MINIMIZATION PROBLEMS WITH LINEAR CONSTRAINTS [J].

CABOT, AV .

NAVAL RESEARCH LOGISTICS, 1974, 21 (02) :265-274

[9] RELAXATION ALGORITHM FOR MINIMIZATION OF A QUASI-CONCAVE FUNCTION ON A CONVEX POLYHEDRON [J].

CARRILLO, MJ .

MATHEMATICAL PROGRAMMING, 1977, 13 (01) :69-80

[10]

CARVAJALMORENO R, 1972, ORC723 U CAL OP RES

← 1 2 3 4 5 →