SELECTING SUBSETS FROM THE SET OF NONDOMINATED VECTORS IN MULTIPLE OBJECTIVE LINEAR-PROGRAMMING

被引:11
作者
ECKER, JG [1 ]
SHOEMAKER, NE [1 ]
机构
[1] OAKLAND UNIV,DEPT MATH,ROCHESTER,MI 48063
关键词
D O I
10.1137/0319030
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:505 / 515
页数:11
相关论文
共 20 条
[1]  
DINKELBACH W, 1972, MULTIPLE CRITERIA DE, P117
[2]  
DINKELBACH W, 1971, UNTERNEHMENSFORSCHUN, P1
[3]  
DINKELBACH W, 1973, MULTIPLE CRITERIA DE, P302
[4]   FINDING ALL EFFICIENT EXTREME POINTS FOR MULTIPLE OBJECTIVE LINEAR PROGRAMS [J].
ECKER, JG ;
KOUADA, IA .
MATHEMATICAL PROGRAMMING, 1978, 14 (02) :249-261
[5]   GENERATING ALL MAXIMAL EFFICIENT FACES FOR MULTIPLE OBJECTIVE LINEAR-PROGRAMS [J].
ECKER, JG ;
HEGNER, NS ;
KOUADA, IA .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1980, 30 (03) :353-381
[6]  
Evans J. P., 1973, Mathematical Programming, V5, P54, DOI 10.1007/BF01580111
[7]   SOME NEW RESULTS ON COMPROMISE SOLUTIONS FOR GROUP DECISION PROBLEMS [J].
FREIMER, M ;
YU, PL .
MANAGEMENT SCIENCE, 1976, 22 (06) :688-693
[8]  
GAL T, UNPUBLISHED
[9]   COMPROMISE SOLUTIONS AND ESTIMATION OF THE NON-INFERIOR SET [J].
GEARHART, WB .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1979, 28 (01) :29-47
[10]  
HEGNER MS, 1977, THESIS RENSSELAER PO