Duality for nondifferentiable minimax fractional programming problem involving higher order (C,α,ρ,d)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(\varvec{C},\varvec{\alpha}, \varvec{\rho}, \varvec{d})$$\end{document}-convexity

In this paper, we present new class of higher-order (C,α,ρ,d)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(C, \alpha , \rho , d)$$\end{document}-convexity and formulate two types of higher-order duality for a nondifferentiable minimax fractional programming problem. Based on the higher-order (C,α,ρ,d)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(C, \alpha , \rho , d)$$\end{document}-convexity, we establish appropriate higher-order duality results. These results extend several known results to a wider class of programs.