Summary: The optimality conditions of [H. C. Lai, J. C. Liu
and K. Tanaka
, J. Math. Anal. Appl. 230, No. 2, 311-328 (1999; Zbl 0916.90251
)] can be used to construct two kinds of parameter-free dual models of nondifferentiable minimax fractional programming problems which involve pseudo-/quasi-convex functions. In this paper, the weak duality, strong duality, and strict converse duality theorems are established for the two dual models.