TY - JOUR
ID - 1032
TI - An algorithm for approximating nondominated points of convex multiobjective optimization problems
JO - Bulletin of the Iranian Mathematical Society
JA - BIMS
LA - en
SN - 1017-060X
AU - Ghaznavi, M.
AU - Azizi, Z.
AD - Faculty of Mathematics, Shahrood University of Technology, Shahrood, Iran
AD - Faculty of Mathematics, Shahrood University of Technology, Shahrood, Iran.
Y1 - 2017
PY - 2017
VL - 43
IS - 5
SP - 1399
EP - 1415
KW - Multiobjective optimization
KW - convexity
KW - nondominated point
KW - efficient solution
KW - approximation algorithm
KW - differentiable problem
DO -
N2 - 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.
UR - http://bims.iranjournals.ir/article_1032.html
L1 - http://bims.iranjournals.ir/article_1032_8a34f64f24ba1df7f512341ae057ca36.pdf
ER -