Non-smooth multi-objective fractional programming problem involving higher order functions

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

“…Moreover, a novel approach is presented by Verma et al [19] to handle multiobjective symmetric fractional programming problems for a higher order defined over cones and explored various duality results with the help of cone invexity. In this link, Kharbanda and Agarwal [11] formulated nonsmooth multiobjective fractional programming problems involving higher order invex functions. Yang [20] established duality results to explore the symmetric dual first order relations under invexity.…”

Higher order symmetric duality for multiobjective fractional programming problems over cones

“…Recently, higher order multiobjective non-differentiable fractional symmetric programs with cone constraints are studied in [8,23]. Some higher order programs are also discussed in [15]. In this paper, motivated by the the work of Dubey and Gupta [8], we study fractional vector optimization problems in which constraints are defined over cones and the ordering of the objectives is described with respect to some closed convex cones.…”