Abstract

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

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call