On second-order duality for nondifferentiable minimax fractional programming

Two types of second‐order dual models for a nondifferentiable minimax fractional programming problem are formulated and proved weak, strong, strict converse duality theorems using $\eta$ ‐bonvexity assumptions. Special cases are also discussed to show that this work extends some known results of the literature.