IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v55y2013i1p5-11.html
   My bibliography  Save this article

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

Author

Listed:
  • Moon Kim
  • Gue Lee

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

Suggested Citation

  • Moon Kim & Gue Lee, 2013. "On efficient applications of G-Karush-Kuhn-Tucker necessary optimality theorems to multiobjective programming problems," Journal of Global Optimization, Springer, vol. 55(1), pages 5-11, January.
    • Handle: RePEc:spr:jglopt:v:55:y:2013:i:1:p:5-11
    DOI: 10.1007/s10898-012-9949-5
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-012-9949-5
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10898-012-9949-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Dehui Yuan & Altannar Chinchuluun & Xiaoling Liu & Panos M. Pardalos, 2007. "Optimality Conditions and Duality for Multiobjective Programming Involving (C, α, ρ, d) type-I Functions," Lecture Notes in Economics and Mathematical Systems, in: Generalized Convexity and Related Topics, pages 73-87, Springer.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Thai Doan Chuong, 2022. "Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization," Annals of Operations Research, Springer, vol. 311(2), pages 997-1015, April.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. M. M. Mäkelä & Y. Nikulin, 2009. "On Cone Characterizations of Strong and Lexicographic Optimality in Convex Multiobjective Optimization," Journal of Optimization Theory and Applications, Springer, vol. 143(3), pages 519-538, December.
    2. N. J. Huang & J. Li & S. Y. Wu, 2009. "Optimality Conditions for Vector Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 142(2), pages 323-342, August.
    3. Ke Zhao & Xue Liu & Zhe Chen, 2011. "A class of r-semipreinvex functions and optimality in nonlinear programming," Journal of Global Optimization, Springer, vol. 49(1), pages 37-47, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:55:y:2013:i:1:p:5-11. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.