Nondifferentiable mathematical programming involving \((G,{\beta})\)-invexity
From MaRDI portal
Publication:387956
DOI10.1186/1029-242X-2012-256zbMath1277.90105OpenAlexW2115379029WikidataQ59291092 ScholiaQ59291092MaRDI QIDQ387956
Guoming Lai, Shengyun Yang, Xiaoling Liu, De-Hui Yuan
Publication date: 17 December 2013
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/1029-242x-2012-256
duality\((G_f, \beta_f)\)-invexity\(G\)-Karush-Kuhn-Tucker necessary optimality conditions\(G\)-Karush-Kuhn-Tucker sufficient optimality conditions
Related Items (1)
Cites Work
- On sufficiency and duality for nonsmooth multiobjective programming problems involving generalized \(V-r\)-invex functions
- \(r\)-preinvexity and \(r\)-invexity in mathematical programming
- New optimality conditions and duality results of \(G\) type in differentiable mathematical programming
- Multiobjective optimization problems with equilibrium constraints
- On \(G\)-invex multiobjective programming. II: Duality
- On \(G\)-invex multiobjective programming. I: Optimality
- Optimality and duality for nonsmooth multiobjective programming problems with \(V\)-\(r\)-invexity
- On sufficiency of the Kuhn-Tucker conditions
- Minimax programming under \((p,r)\)-invexity
- Optimality for nonsmooth fractional multiple objective programming
- Nonsmooth minimax programming problems withV−r-invex functions
- GeneralizedB-(p,r)-Invexity Functions and Nonlinear Mathematical Programming
- What is invexity?
- \((p,r)\)-invex sets and functions
This page was built for publication: Nondifferentiable mathematical programming involving \((G,{\beta})\)-invexity
