IDEAS home Printed from https://ideas.repec.org/h/spr/lnechp/978-3-540-37007-9_3.html
   My bibliography  Save this book chapter

Optimality Conditions and Duality for Multiobjective Programming Involving (C, α, ρ, d) type-I Functions

In: Generalized Convexity and Related Topics

Author

Listed:
  • Dehui Yuan

    (Hanshan Teachers’ College)

  • Altannar Chinchuluun

    (University of Florida)

  • Xiaoling Liu

    (Hanshan Teachers’ College)

  • Panos M. Pardalos

    (University of Florida)

Abstract

Summary In this chapter, we present a unified formulation of generalized convex functions. Based on these concepts, sufficient optimality conditions for a nondifferentiable multiobjective programming problem are presented. We also introduce a general Mond-Weir type dual problem of the problem and establish weak duality theorem under generalized convexity assumptions. Strong duality result is derived using a constraint qualification for nondifferentiable multiobjective programming problems.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:lnechp:978-3-540-37007-9_3
    DOI: 10.1007/978-3-540-37007-9_3
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    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. 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.
    4. 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:lnechp:978-3-540-37007-9_3. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.