Higher Order Symmetric Duality in Nondifferentiable Fractional Variational Problems Over Cone Constraints

This paper focused on a pair of higher order nondifferentiable symmetric fractional variational programming problems defined over cone constraints and explores the pertinent duality output based on the idea of higher order (C,α,ρ,d)- convexity and established weak, strong and converse duality theorems. In order to support the definitions, a numerical example is given. Further, a static case of the problem is also constructed.