Nondifferentiable minimax fractional programming problems with \((C, \alpha, \rho, d)\)-convexity (Q2370036): Difference between revisions

To relax the convexity assumptions imposed on the theorems on sufficient optimality conditions and duality, various generalized convexity notations have been proposed in the literature. In this paper the authors consider optimality conditions and duality theorems for the generalized fractional nondifferentiable programming in the framework of a new unified formulation of generalized convexity, called \((C,\alpha,\rho,d)\)-convexity.