In this paper, we study a nondifferentiable minimax fractional programming problem under the assumptions of generalized second order $(\Cal F,\alpha,\rho,d)$-convexity. A second order parametric dual is formulated. Weak, strong and converse duality theorems are established in order to relate the primal and dual problems under the afore-said assumptions.