%0 Journal Article %T An algorithm for approximating nondominated points of convex multiobjective optimization problems %J Bulletin of the Iranian Mathematical Society %I Iranian Mathematical Society (IMS) %Z 1017-060X %A Ghaznavi, M. %A Azizi, Z. %D 2017 %\ 10/31/2017 %V 43 %N 5 %P 1399-1415 %! An algorithm for approximating nondominated points of convex multiobjective optimization problems %K Multiobjective optimization‎ %K ‎convexity‎ %K ‎nondominated point‎ %K ‎efficient solution‎ %K ‎approximation algorithm‎ %K ‎differentiable problem‎ %R %X ‎In this paper‎, ‎we present an algorithm for generating approximate nondominated points of a multiobjective optimization problem (MOP)‎, ‎where the constraints and the objective functions are convex‎. ‎We provide outer and inner approximations of nondominated points and prove that inner approximations provide a set of approximate weakly nondominated points‎. ‎The proposed algorithm can be applied for differentiable or nondifferentiable convex MOPs‎. ‎To illustrate efficiency of the proposed algorithm for convex MOPs‎, ‎we provide numerical examples. %U http://bims.iranjournals.ir/article_1032_8a34f64f24ba1df7f512341ae057ca36.pdf