Abstract
In this article, we are concerned with a class of non-differentiable minimax fractional programming problems and their higher-order dual model. Weak, strong and converse duality theorems are discussed involving generalized higher-order type I functions. The presented results extend some previously known results on non-differentiable minimax fractional programming.