%0 Journal Article
%T Benson's algorithm for nonconvex multiobjective problems via nonsmooth Wolfe duality
%J Bulletin of the Iranian Mathematical Society
%I Springer and the Iranian Mathematical Society (IMS)
%Z 1017-060X
%A Shafiei, N.
%D 2017
%\ 10/31/2017
%V 43
%N 5
%P 975-994
%! Benson's algorithm for nonconvex multiobjective problems via nonsmooth Wolfe duality
%K Multiobjective optimization
%K approximation algorithm
%K efficient solution
%K nondominated point
%R
%X 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.
%U http://bims.iranjournals.ir/article_968_b6e2e95fca85f00c6ce71f96f05c8755.pdf