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

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.