Generating the weakly efficient set of nonconvex multiobjective problems

被引：0
作者：
Daniel Gourion
Dinh The Luc
机构：
[1] University of Avignon,
来源：
Journal of Global Optimization | 2008年 / 41卷
关键词：
Nonconvex multiobjective problem; Weakly efficient solution; Scalarization; 90C31;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We present a method for generating the set of weakly efficient solutions of a nonconvex multiobjective optimization problem. The convergence of the method is proven and some numerical examples are encountered.
引用
收藏
页码：517 / 538
页数：21
相关论文
共 27 条
[1]  
Armand P.(1993)Finding all maximal efficient faces in multiobjective linear programming Math. Program. Ser. A 61 357-375
[2]  
Benson H.P.(1979)Vector maximization with two objective functions J. Optim. Theory Appl. 28 253-257
[3]  
Benson H.P.(1998)An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem J. Glob. Optim. 13 1-24
[4]  
Benson H.P.(2000)Outcome space partition of the weight set in multiobjective linear programming J. Optim. Theory Appl. 105 17-36
[5]  
SUN E.(1998)Normal-boundary intersection: a new method for generating the Pareto surface in nonlinear multicriteria optimization problems SIAM J. Optim. 8 631-657
[6]  
Das I.(2000)Normal cones to a polyhedral convex set and generating efficient faces in linear multiobjective programming Acta Mathematica Vietnamica 25 101-124
[7]  
Dennis J.E.(2002)Unbiased approximation in multicriteria optimization Math. Methods Oper. Res. 56 413-457
[8]  
Kim N.T.B.(1987)Scalarization of vector optimization problems J. Optim. Theory Appl. 55 85-102
[9]  
Luc D.T.(2005)Scalarizing functions for generating the weakly efficient solution set in convex multiobjective problems SIAM J. Optim. 15 987-1001
[10]  
Klamroth K.(2006)A new duality approach to solving concave vector maximization problems J. Glob. Optim. 36 401-423
123