STEEPEST ASCENT ALGORITHMS FOR NONCONICAL MULTIPLE OBJECTIVE PROGRAMMING

被引：1

作者：

HAZEN, GB ^{[1
]}

MORIN, TL ^{[1
]}

机构：

[1] PURDUE UNIV,SCH IND ENGN,W LAFAYETTE,IN 47907

来源：

JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS | 1984年 / 100卷 / 01期

关键词：

D O I：

10.1016/0022-247X(84)90075-1

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：188 / 221

页数：34

共 50 条

[1] OPTIMALITY CONDITIONS IN NONCONICAL MULTIPLE-OBJECTIVE PROGRAMMING
HAZEN, GB
MORIN, TL
[J]. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1983, 40 (01) : 25 - 60
[2] APPLICATION OF THE STEEPEST ASCENT METHOD TO CONVEX PROGRAMMING
PIETRZYKOWSKI, T
[J]. COMMUNICATIONS OF THE ACM, 1962, 5 (06) : 315 - 315
[3] Steepest Ascent for Multiple-Response Applications
Mee, Robert W.
Xiao, Jihua
[J]. TECHNOMETRICS, 2008, 50 (03) : 371 - 382
[4] THE STEEPEST-ASCENT METHOD FOR THE LINEAR-PROGRAMMING PROBLEM
DENEL, J
FIOROT, JC
HUARD, P
[J]. RAIRO-ANALYSE NUMERIQUE-NUMERICAL ANALYSIS, 1981, 15 (03): : 195 - 200
[5] Optimal insurance risk allocation with steepest ascent and genetic algorithms
Ha, SiewMun
[J]. JOURNAL OF RISK FINANCE, 2013, 14 (02) : 129 - 139
[6] Using objective values to start multiple objective linear programming algorithms
Arbel, A
Korhonen, P
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2001, 128 (03) : 587 - 596
[7] COMPLETE EFFICIENCY AND THE INITIALIZATION OF ALGORITHMS FOR MULTIPLE OBJECTIVE PROGRAMMING
BENSON, HP
[J]. OPERATIONS RESEARCH LETTERS, 1991, 10 (08) : 481 - 487
[8] MULTICRITERIA STEEPEST ASCENT
DUINEVELD, CAA
BRUINS, CHP
SMILDE, AK
BOLHUIS, GK
ZUURMAN, K
DOORNBOS, DA
[J]. CHEMOMETRICS AND INTELLIGENT LABORATORY SYSTEMS, 1994, 25 (02) : 183 - 201
[9] NEW PROCEDURE FOR STEEPEST ASCENT
MYERS, RH
KHURI, AI
[J]. COMMUNICATIONS IN STATISTICS PART A-THEORY AND METHODS, 1979, 8 (14): : 1359 - 1376
[10] PROPERTY OF METHOD OF STEEPEST ASCENT
JOHNSON, CH
FOLKS, JL
[J]. ANNALS OF MATHEMATICAL STATISTICS, 1964, 35 (01): : 435 - &

← 1 2 3 4 5 →