کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
471726 | 698659 | 2010 | 12 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Saddle points criteria in nondifferentiable multiobjective programming with VV-invex functions via an ηη-approximation method
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
The ηη-approximation method is used to a characterization of solvability of nonconvex nondifferentiable multiobjective programming problems. A family of ηη-approximated vector optimization problems is constructed in this approach for the original nondifferentiable multiobjective programming problem. The definitions of a vector-valued ηη-Lagrange function and of an ηη-saddle point for this family of ηη-approximated vector optimization problems are introduced. Thus, the equivalence between a (weak) Pareto optimum of the original multiobjective programming problems and an ηη-saddle point of the ηη-Lagrange function in its associated ηη-approximated vector optimization problems is established under VV-invexity.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Mathematics with Applications - Volume 60, Issue 9, November 2010, Pages 2689–2700
Journal: Computers & Mathematics with Applications - Volume 60, Issue 9, November 2010, Pages 2689–2700
نویسندگان
Tadeusz Antczak,