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

Moon Kim () and Gue Lee ()

Journal of Global Optimization, 2013, vol. 55, issue 1, 5-11

Abstract: 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, 2009 ), 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

Keywords: Weakly efficient solution; G-Karush-Kuhn-Tucker necessary optimality condition; Kuhn-Tucker constraint qualification (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10898-012-9949-5 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jglopt:v:55:y:2013:i:1:p:5-11

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-012-9949-5

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().