Duality without a constraint qualification for minimax fractional programming
Journal of Optimization Theory and Applications
Nondifferentiable minimax fractional programming under generalized univexity
Journal of Computational and Applied Mathematics
On Minimax Fractional Optimality and Duality with Generalized Convexity
Journal of Global Optimization
Generalized α-invexity and nondifferentiable minimax fractional programming
Journal of Computational and Applied Mathematics
Non-differentiable minimax fractional programming with generalized α-univexity
Journal of Computational and Applied Mathematics
Second-order duality in nondifferentiable minmax programming involving type-I functions
Journal of Computational and Applied Mathematics
On necessary conditions for a class of nondifferentiable minimax fractional programming
Journal of Computational and Applied Mathematics
Nondifferentiable minimax fractional programming in complex spaces with parametric duality
Journal of Global Optimization
Duality on a nondifferentiable minimax fractional programming
Journal of Global Optimization
On second-order duality for nondifferentiable minimax fractional programming
Journal of Computational and Applied Mathematics
Hi-index | 0.00 |
The optimality conditions of [Lai et al. (J. Math. Anal. Appl. 230 (1999) 311)] can be used to construct two kinds of parameter-free dual models of nondifferentiable minimax fractional programming problems which involve pseudo-/quasi-convex functions. In this paper, the weak duality, strong duality, and strict converse duality theorems are established for the two dual models.