Correspondence between a new class of generalized cone convexity and higher order duality

In this paper, a new class of generalized higher order cone convex functions is first introduced. A fractional nondifferentiable vector optimization problem is discussed in which each component of objective and constraints contain support function. Then a Schaible type dual model is constructed for this vector programming problem. Lastly weak and strong duality theorems are formulated and proved.