دوره 20، شماره 1 - ( 1-1404 )
جلد 20 شماره 1 صفحات 229-205 |
برگشت به فهرست نسخه ها
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Antczak T, Ahmad I. New Concepts of Generalized Convexity in Multiobjective Subset Programming. IJMSI 2025; 20 (1) :205-229
URL: http://ijmsi.ir/article-1-1919-fa.html
URL: http://ijmsi.ir/article-1-1919-fa.html
New Concepts of Generalized Convexity in Multiobjective Subset Programming. مجله علوم ریاضی و انفورماتیک. 1404; 20 (1) :205-229
چکیده:
In this paper, a new class of nonconvex differentiable multiobjective programming problems involving n-set functions with both inequality and equality constraints is considered. Then, under V-r-convexity and/or generalized V-r-convexity hypotheses, several suffcient optimality conditions, saddle point criteria and various mixed duality theorems are proved for such not necessarily convex vector optimization problems involving n-set functions.
| بازنشر اطلاعات | |
 |
این مقاله تحت شرایط Creative Commons Attribution-NonCommercial 4.0 International License قابل بازنشر است. |
