A note on weighted criteria methods for compromise solutions in multi-objective optimization

被引:177
作者
Athan, TW [1 ]
Papalambros, PY [1 ]
机构
[1] UNIV MICHIGAN,DEPT MECH ENGN & APPL MECH,ANN ARBOR,MI 48109
关键词
multicriteria; multiobjective; design optimization; non-convex; Pareto solutions;
D O I
10.1080/03052159608941404
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
A common multi-objective optimization approach forms the objective function from linearly weighted criteria. It is known that the method can fail to capture Pareto optimal points in a non-convex attainable region. This note considers generalized weighted criteria methods that retain the advantages of the linear method without suffering from this limitation. Compromise programming and a new method with exponentially weighted criteria are evaluated. Demonstration on design problems is included.
引用
收藏
页码:155 / 176
页数:22
相关论文
共 15 条