Generalized minimax programming with nondifferentiable \((G, \beta)\)-invexity
From MaRDI portal
Publication:2375696
DOI10.1155/2013/854125zbMath1266.90193WikidataQ59004884 ScholiaQ59004884MaRDI QIDQ2375696
Publication date: 14 June 2013
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/854125
90C47: Minimax problems in mathematical programming
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Duality in nondifferentiable minimax fractional programming with \(B-(p, r)\)-invexity
- Nondifferentiable mathematical programming involving \((G,{\beta})\)-invexity
- Nonsmooth minimax programming under locally Lipschitz \((\Phi , \rho )\)-invexity
- On duality theorems for a nondifferentiable minimax fractional programming
- New optimality conditions and duality results of \(G\) type in differentiable mathematical programming
- Generalized fractional minimax programming with \(B-(p,r)\)-invexity
- On \(G\)-invex multiobjective programming. II: Duality
- On \(G\)-invex multiobjective programming. I: Optimality
- On sufficiency of the Kuhn-Tucker conditions
- On efficiency and duality for multiobjective programs
- Minimax programming under \((p,r)\)-invexity
- Nondifferentiable minimax fractional programming problems with \((C, \alpha, \rho, d)\)-convexity
- Nonsmooth minimax programming problems withV−r-invex functions
- What is invexity?
- The Notion of V-r-Invexity in Differentiable Multiobjective Programming
- A characterization of strict local minimizers of order one for nonsmooth static minmax problems
- \((p,r)\)-invex sets and functions
- Optimality conditions and duality for a class of nonlinear fractional programming problems.
