Sufficiency and duality in nondifferentiable multiobjective fractional programming with higher-order (V, α, ρ, θ)-invexity

Abstract

In the present paper, the concept of higher-order (V , α , ρ , θ) invexity is used to study higher-order duality for a nondifferentiable multiobjective fractional programming problem (MFP). We first obtain a result giving higher-order (V, α, ρ, θ)-invexity of the ratio of two functions. This result is then used to drive sufficient optimality conditions for an efficient solution of (MFP). Moreover, duality theorems are established for Mond-Weir type higher-order dual of (MFP).