On efficient applications of \(G\)-Karush-Kuhn-Tucker necessary optimality theorems to multiobjective programming problems

DOI10.1007/s10898-012-9949-5zbMath1263.90086OpenAlexW2004189951MaRDI QIDQ1937961

Gue Myung Lee, Moon Hee Kim

Publication date: 1 February 2013

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-012-9949-5

zbMATH Keywords

weakly efficient solutionKuhn-Tucker constraint qualification\(G\)-Karush-Kuhn-Tucker necessary optimality condition

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)

Related Items

Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization

Cites Work

• Unnamed Item
• Unnamed Item
• New optimality conditions and duality results of \(G\) type in differentiable mathematical programming
• On \(G\)-invex multiobjective programming. II: Duality
• On \(G\)-invex multiobjective programming. I: Optimality
• Theory of multiobjective optimization
• Maximal vectors and multi-objective optimization
• A survey of recent developments in multiobjective optimization
• Proper efficiency and the theory of vector maximization