On Nondifferentiable Minimax Fractional Programming Involving Higher Order Generalized Convexity

Anurag Jayswal, Ashish Kumar Prasad, Krishna Kummari

In this article, we focus our study on a nondifferentiable minimax fractional programming problem and establish weak, strong and strict converse duality theorems under generalized higher order $\Cal F,\alpha,\rho,d)$-type I assumptions. Our results extend and unify some of the known results in the literature.