Iranian Mathematical Society (IMS)Bulletin of the Iranian Mathematical Society1017-060X43520171031Benson's algorithm for nonconvex multiobjective problems via nonsmooth Wolfe duality975994968ENN.ShafieiDepartment of Mathematics, University of Isfahan, Isfahan, Iran.Journal Article20150420In 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.http://bims.iranjournals.ir/article_968_b6e2e95fca85f00c6ce71f96f05c8755.pdf