Abstract: This paper proposes the concepts of decreasing, unchanging, non-increasing and non-decreasing direction set of the generalized cone-convex function with respect to a cone ∧. Based on discussing their propertics and distinguishing their conditions, this paper gives the Sufficient and necessary conditions of which the points in feasible domain arc the cone ∧-efficient solution.

Key words: Multiobjective programming, Generalizcd cone-convex, cone-efficient solution