Optimality conditions in nondifferentiable G-invex multiobjective programming
From MaRDI portal
Publication:978416
DOI10.1155/2010/172059zbMATH Open1189.90140OpenAlexW2053043541WikidataQ59249996 ScholiaQ59249996MaRDI QIDQ978416FDOQ978416
Authors: Ho Jung Kim, You Young Seo, Do Sang 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
Recommendations
- Multiobjective programming under nondifferentiable \(G\)-\(V\)-invexity
- On \(G\)-invex multiobjective programming. I: Optimality
- Optimality conditions for \((G,\alpha)\) invex multiobjective programming
- scientific article; zbMATH DE number 6609786
- Nondifferentiable multiobjective programming under generalized \(d_I\)-invexity
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Cites Work
- Optimization and nonsmooth analysis
- On sufficiency of the Kuhn-Tucker conditions
- What is invexity?
- Necessary and sufficient conditions in constrained optimization
- On generalised convex mathematical programming
- Non differentiable symmetric duality
- Title not available (Why is that?)
- The essence of invexity
- On \(G\)-invex multiobjective programming. II: Duality
- On \(G\)-invex multiobjective programming. I: Optimality
- Optimality criteria and duality in multiple-objective optimization involving generalized invexity
- Title not available (Why is that?)
- Maximal vectors and multi-objective optimization
- Efficiency and generalized convex duality for multiobjective programs
- Optimality and duality for a class of nondifferentiable multiobjective fractional programming problems
- Duality for a class of nondifferentiable multiobjective programming problems
- A note on invex functions and duality in multiple objective optimization
Cited In (8)
- Title not available (Why is that?)
- Multiobjective programming under nondifferentiable \(G\)-\(V\)-invexity
- On \(G\)-invex multiobjective programming. I: Optimality
- Necessary conditions for suboptimization over the weakly efficient set associated to generalized invex multiobjective programming
- Optimality conditions for \((G,\alpha)\) invex multiobjective programming
- Title not available (Why is that?)
- Optimality conditions of the \(G\)-type in locally Lipschitz multiobjective programming
- On efficient applications of \(G\)-Karush-Kuhn-Tucker necessary optimality theorems to multiobjective programming problems
This page was built for publication: Optimality conditions in nondifferentiable \(G\)-invex multiobjective programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q978416)
