Finding properly efficient solutions of nonconvex multiobjective optimization problems with a minimum bound for trade-offs

	Finding properly efficient solutions of nonconvex multiobjective optimization problems with a minimum bound for trade-offs
International Journal of Nonlinear Analysis and Applications
مقاله 20، دوره 15، شماره 5، مرداد 2024، صفحه 239-245 اصل مقاله (349.43 K)
نوع مقاله: Research Paper
شناسه دیجیتال (DOI): 10.22075/ijnaa.2023.29577.4197
نویسندگان
Narges Hoseinpoor¹؛ Mehrdad Ghaznavi^* ²
¹Faculty of Mathematical Sciences, Shahrood University of Technology, Shahrood, Iran
²Faculty of Mathematical Sciences, shahrood University of Technology, Shahrood, Iran
چکیده
In the presented paper, we investigate efficient solutions to optimization problems with multiple criteria and bounded trade-offs. A nonlinear optimization problem to find the relationships between the upper bound for trade-offs and objective functions is presented. Due to this problem, we determine some properly efficient points that are closer to the ideal point. To this end, we apply the extended form of the generalized Tchebycheff norm. Note that all the presented results work for general problems and no convexity assumption is needed.
کلیدواژه‌ها
Multiobjective programming؛ Tchebycheff norm؛ Trade-off؛ Proper efficiency
مراجع

آمار تعداد مشاهده مقاله: 32,701 تعداد دریافت فایل اصل مقاله: 22,954

پیوندهای مفید

آمار