Efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized (ϝ, α, ϱ, θ)-V-convex functions

AbstractIn this paper, we first introduce a new class of generalized convex n-set functions, called (ϝ, α, ϱ, θ)-V-convex functions, and then present numerous sets of parametric and semiparametric sufficient efficiency conditions under generalized (ϝ, α, ϱ, θ)-V-convexity assumptions for a multiobjective fractional subset programming problem. Moreover, we construct three parametric and three semiparametric duality models and prove appropriate duality theorems