Some new concepts of coneD_s convexity,coneD-s quasiconvexity,cone D-s pseudoconvexity,s right derivative of vector value mapping are proposed;and their related properties are discussed;the optimality necessary conditions and sufficient conditions for constrained extremum problem(VP)involving in cone D-s convex mapping are extablished;the relation between local optimal solution and global optimal solution;as well as the relation between weakly efficient solution and efficient solution for (VP) are derived;the corresponding results generalize the related results of classic convex programming.