Finding the extreme efficient solutions of multi-objective pseudo-convex programming problem

	Finding the extreme efficient solutions of multi-objective pseudo-convex programming problem
AUT Journal of Mathematics and Computing
مقاله 7، دوره 6، شماره 1، 2025، صفحه 67-77 اصل مقاله (531.65 K)
نوع مقاله: Original Article
شناسه دیجیتال (DOI): 10.22060/ajmc.2023.22132.1135
نویسندگان
Alireza Fakharzadeh Jahromi؛ Hassan Rostamzadeh^*
Department of OR, Faculty of Mathematics, Shiraz University of Technology, Iran
چکیده
In this paper, we present two methods to find the strictly efficient and weakly efficient points of multi-objective programming (MOP) problems in which their objective functions are pseudo-convex and their feasible sets are polyhedrons. The obtained efficient solutions in these methods are the extreme points. Since the pseudo-convex functions are quasi-convex as well, therefore the presented methods can be used to find efficient solutions of the (MOP) problem with the quasi-convex objective functions and the polyhedron feasible set. Two experimental examples are presented.
کلیدواژه‌ها
Multi-objective programming‎؛ Efficient solution‎؛ Weakly efficient solution‎؛ Pseudo-convex function؛ Quasi-convex function
مراجع

آمار تعداد مشاهده مقاله: 743 تعداد دریافت فایل اصل مقاله: 424