Second-order duality in nondifferentiable fractional programming

A second-order dual is formulated for a nondifferentiable fractional programming problem. Using the generalized second-order (F,α,ρ,d)(F,α,ρ,d)-convexity assumptions on the functions involved, weak, strong and converse duality theorems are established in order to relate the primal and dual problems.