A Newton method for multiobjective optimization problems with interval-valued objective functions
Publish place: 2rd International Conference on Soft Computing
Publish Year: 1396
نوع سند: مقاله کنفرانسی
زبان: English
View: 408
This Paper With 9 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
CSCG02_105
تاریخ نمایه سازی: 7 اسفند 1396
Abstract:
In this study, we obtain (weak) Pareto optimal solutions of an unconstrained multiobjective optimization problem (MOP) with interval-valued objective functions by applying Newton method. We consider a suitable partial ordering for a pair of intervals for attaining Pareto solutions of the MOP problem. We employ the generalized Hukuhara differentiability of interval-valued vector functions to derive Newton method. It is assumed that the objective functions of the interval-valued MOP are twice continuously generalized Hukuhara differentiable. Therefore, utilizing critical points of the related crisp problem, some necessary and sufficient conditions for weakly Pareto optimal solutions of an interval-valued MOP are obtained
Keywords:
Authors
M. Ghaznavi
Faculty of Mathematical Sciences, Shahrood University of Technology, Shahrood, Iran
N. Hoseinpoor
Faculty of Mathematical Sciences, Shahrood University of Technology, Shahrood, Iran