On a general duality model in multiobjective fractional programming with nn-set functions

We consider some types of generalized convexity and discuss duality results for a fractional programming problem involving (F,b,ϕ,ρ,θ)(F,b,ϕ,ρ,θ)-univex nn-set functions. Almost all results presented until now in the literature were obtained under the assumption that the function FF is sublinear or, in the last time, convex in the third argument. In our approach, we suppose that FF is a quasiconvex function in the third argument.