On nondifferentiable minimax fractional programming under generalized \(\alpha\)-type I invexity
From MaRDI portal
Publication:1034974
DOI10.1007/s12190-008-0214-5zbMath1175.49007MaRDI QIDQ1034974
J. S. Rautela, Shashi Kant Mishra
Publication date: 9 November 2009
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-008-0214-5
convexity; duality; sufficient optimality conditions; generalized \(\alpha\)-type I invexity; nondifferentiable minimax fractional programming problems
90C32: Fractional programming
49J35: Existence of solutions for minimax problems
49N15: Duality theory (optimization)
26A51: Convexity of real functions in one variable, generalizations
49K27: Optimality conditions for problems in abstract spaces
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On duality theorems for a nondifferentiable minimax fractional programming
- Necessary conditions and sufficient conditions for static minmax problems
- On minimax fractional optimality conditions with invexity
- Necessary and sufficient conditions for minimax fractional programming
- Efficiency conditions and duality for a class of multiobjective fractional programming problems
- Efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized \(({\mathcal F},\alpha,\rho,\theta)\)-\(V\)-convex functions
- Nondifferentiable minimax fractional programming problems with \((C, \alpha, \rho, d)\)-convexity
- Generalized \(\alpha\)-invexity and nondifferentiable minimax fractional programming
- Optimality conditions and duality for nondifferentiable multiobjective fractional programming with generalized convexity
- Generalized pseudo-convex minmax programming.
- Multiple objective fractional programming involving semilocally type I-preinvex and related functions
- On vector variational-like inequality problems
- Duality for fractional minimax programming problems
- Generalized fractional programming problems containing locally subdifferentiable andρ-Univex functions
