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

We prove a slightly modified G-Karush-Kuhn-Tucker necessary optimality theorem for multiobjective programming problems, which was originally given by Antczak (J Glob Optim 43:97–109, <CitationRef CitationID="CR2">2009</CitationRef>), and give an example showing the efficient application of (modified) G-Karush-Kuhn-Tucker optimality theorem to the problems. Copyright Springer Science+Business Media, LLC. 2013

MoreLess

Year of publication:	2013
Authors:	Kim, Moon ; Lee, Gue
Published in:	Journal of Global Optimization. - Springer. - Vol. 55.2013, 1, p. 5-11
Publisher:	Springer
Subject:	Weakly efficient solution \| G-Karush-Kuhn-Tucker necessary optimality condition \| Kuhn-Tucker constraint qualification

More details

Extent:	text/html
Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10010994180