In the present paper, a newly combined higher-order non-differentiable symmetric duality in scalar-objective programming over arbitrary cones is formulated. literature we have discussed primal-dual results with cones, while this article, derived result one model cones. The theorems of are for these problems under ?-pseudoinvexity/?-invexity/C-pseudoconvexity/C-convexity speculations