In the present paper, we move forward in the study of minimax fractional programming problem and establish sufficient optimality conditions under the assumptions of generalized (Hp, r)-invexity. Weak, strong and strict converse duality theorems are also derived for two types of dual models related to minimax fractional programming problem involving aforesaid invex functions. In order to show the existence of introduced class of functions, examples are given.