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

Document Type : Original Article


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.


Main Subjects