On Nondifferentiable Minimax Fractional Programming Involving Generalized (C, a, p, d)-Convexity

摘要

In the present paper we focus our study on a nondifferentiable minimax programming problem and establish sufficient optimality conditions under the assumptions of generalized (C, a, p, d)-convexity. Subsequently, we apply the optimality condition to formulate two types of dual problems and prove appropriate duality theorems.