TY - JOUR
ID - 968
TI - Benson's algorithm for nonconvex multiobjective problems via nonsmooth Wolfe duality
JO - Bulletin of the Iranian Mathematical Society
JA - BIMS
LA - en
SN - 1017-060X
AU - Shafiei, N.
AD - Department of Mathematics, University of Isfahan, Isfahan, Iran.
Y1 - 2017
PY - 2017
VL - 43
IS - 5
SP - 975
EP - 994
KW - Multiobjective optimization
KW - approximation algorithm
KW - efficient solution
KW - nondominated point
DO -
N2 - In this paper, we propose an algorithm to obtain an approximation set of the (weakly) nondominated points of nonsmooth multiobjective optimization problems with equality and inequality constraints. We use an extension of the Wolfe duality to construct the separating hyperplane in Benson's outer algorithm for multiobjective programming problems with subdifferentiable functions. We also formulate an infinitive approximation set of the (weakly) nondominated points of biobjective optimization problems. Moreover, we provide some numerical examples to illustrate the advantage of our algorithm.
UR - http://bims.iranjournals.ir/article_968.html
L1 - http://bims.iranjournals.ir/article_968_b6e2e95fca85f00c6ce71f96f05c8755.pdf
ER -