Higher-order (F, α, β, ρ, d, E)-convexity in Fractional Programming

Abstract:

      In this paper we define higher order (F, α, β, ρ, d, E)-convex function with respect to E-differentiable function K and obtain optimality conditions for nonlinear programming problem (NP) from the concept of higher order (F, α, β, ρ, d)-convexity. Here, we establish Mond-Weir and Wolfe duality for (NP) and utilize these duality in nonlinear fractional programming problem.