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.
Rostamzadeh, H., & Fakharzadeh Jahromi, A. R. (2023). Finding the extreme efficient solutions of multi-objective pseudo-convex programming problems. AUT Journal of Mathematics and Computing, (), -. doi: 10.22060/ajmc.2023.22132.1135
MLA
Hassan Rostamzadeh; Ali Reza Fakharzadeh Jahromi. "Finding the extreme efficient solutions of multi-objective pseudo-convex programming problems". AUT Journal of Mathematics and Computing, , , 2023, -. doi: 10.22060/ajmc.2023.22132.1135
HARVARD
Rostamzadeh, H., Fakharzadeh Jahromi, A. R. (2023). 'Finding the extreme efficient solutions of multi-objective pseudo-convex programming problems', AUT Journal of Mathematics and Computing, (), pp. -. doi: 10.22060/ajmc.2023.22132.1135
VANCOUVER
Rostamzadeh, H., Fakharzadeh Jahromi, A. R. Finding the extreme efficient solutions of multi-objective pseudo-convex programming problems. AUT Journal of Mathematics and Computing, 2023; (): -. doi: 10.22060/ajmc.2023.22132.1135
)