Minimax fractional programming for \(n\)-set functions and mixed-type duality under generalized Invexity
DOI10.1007/s10957-008-9410-6zbMath1189.90191OpenAlexW2019565848MaRDI QIDQ1014021
Publication date: 24 April 2009
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-008-9410-6
duality theoremsminimax fractional programmingmixed-type dualpartial differentiable \(n\)-set functionpseudo-invex set functionquasi-invex set function
Minimax problems in mathematical programming (90C47) Optimality conditions and duality in mathematical programming (90C46) Fractional programming (90C32)
Related Items (4)
Cites Work
- Unnamed Item
- Optimization theory for n-set functions
- Optimal constrained selection of a measurable subset
- Duality in mathematical programming of set functions: On Fenchel duality theorem
- Optimization theory for set functions in nondifferentiable fractional programming with mixed type duality
- Moreau-Rockafellar type theorem for convex set functions
- Duality for a minimax programming problem containing \(n\)-set functions
- Necessary and sufficient conditions for minimax fractional programming
- Duality without a constraint qualification for minimax fractional programming
- Optimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex set functions
- Duality for minmax \(B\)-vex programming involving \(n\)-set functions
- Parameter-free dual models for fractional programming with generalized invexity
- On minimax fractional programming of generalized convex set functions
- Duality for generalized fractional programs involving n-set functions
- Sufficiency and duality of fractional integral programming with generalized invexity
- The Fenchel-Moreau Theorem for Set Functions
- A duality theorem for non-linear programming
- Saddle point and duality in the optimization theory of convex set functions
- Oil minmax programming problems containing n-set functions
- Minimax fractional programming involving generalised invex functions
- On mixed duality in mathematical programming.
This page was built for publication: Minimax fractional programming for \(n\)-set functions and mixed-type duality under generalized Invexity