Mixed‐Type Multiobjective Nondifferentiable Symmetric Duality Programming Problem Over Arbitrary Cones

ABSTRACT

In the present article, we formulate mixed‐type multiobjective nondifferentiable symmetric duality over cone and derive the duality results under ‐‐convex and ‐‐pseudoconvex. Also, we give non‐trivial examples of ‐‐convex and ‐‐pseudoconvex and show that every ‐‐convex need not be ‐‐pseudoconvex. We give non‐trivial examples of some basic definitions used in this research area. Also, some graphs are used to understand the information better. The outcomes we obtained expand upon several earlier discoveries in the field.