In this article, we focus our study on a nondifferentiable minimax fractional programming problem and establish weak, strong and strict converse duality theorems under generalized higher order (F, α, ρ, d)-Type I assumptions. Our results extend and unify some of the known results in the literature.