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
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 |
Saved in:
Online Resource
Saved in favorites
Similar items by subject
-
An adaptive nonmonotone line search for multiobjective optimization problems
Ghalavand, Nasim, (2021)
-
Le Thanh Tung, (2018)
-
A lexicographic radial projection onto the efficient frontier in Data Envelopment Analysis
Korhonen, Pekka J., (2018)
- More ...
Similar items by person