Abstract: We establish the necessary and sufficient optimality conditions for nondifferentiable minimax fractional programming problems. Subsequently, applying the optimality conditions, we constitute two dual models: Mond-Weir type and Wolfe type. For these duality types, we prove three duality theorems—weak duality theorem, strong duality theorem, and strict converse duality theorem.