Optimality conditions in nondifferentiable \(G\)-invex multiobjective programming
From MaRDI portal
Publication:978416
DOI10.1155/2010/172059zbMath1189.90140OpenAlexW2053043541WikidataQ59249996 ScholiaQ59249996MaRDI QIDQ978416
You Young Seo, Do Sang Kim, Ho Jung Kim
Publication date: 24 June 2010
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/226592
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Cites Work
- Unnamed Item
- Unnamed Item
- The essence of invexity
- On \(G\)-invex multiobjective programming. II: Duality
- On \(G\)-invex multiobjective programming. I: Optimality
- A note on invex functions and duality in multiple objective optimization
- On sufficiency of the Kuhn-Tucker conditions
- Maximal vectors and multi-objective optimization
- Efficiency and generalized convex duality for multiobjective programs
- Optimality criteria and duality in multiple-objective optimization involving generalized invexity
- Duality for a class of nondifferentiable multiobjective programming problems
- Optimality and duality for a class of nondifferentiable multiobjective fractional programming problems
- Optimization and nonsmooth analysis
- What is invexity?
- Necessary and sufficient conditions in constrained optimization
- On generalised convex mathematical programming
- Non differentiable symmetric duality
This page was built for publication: Optimality conditions in nondifferentiable \(G\)-invex multiobjective programming
