IDEAS home Printed from https://ideas.repec.org/p/hal/cesptp/halshs-00113148.html
   My bibliography  Save this paper

On constraint qualifications with generalized convexity and optimality conditions

Author

Listed:
  • Manh-Hung Nguyen

    (CES - Centre d'économie de la Sorbonne - UP1 - Université Paris 1 Panthéon-Sorbonne - CNRS - Centre National de la Recherche Scientifique)

  • Do Van Luu

    (Institut de Mathématiques [Hanoi] - Académie des Sciences et Techniques)

Abstract

This paper deals with a multiobjective programming problem involving both equality constraints in infinite dimensional spaces. It is shown that some constraint qualifications together with a condition of interior points are sufficient conditions for the invexity of constraint maps with respect to the same scale map. Under a new constraint qualification which involves an invexity condition and a generalized Slater condition a Kuhn-Tucker necessary condition is established.

Suggested Citation

  • Manh-Hung Nguyen & Do Van Luu, 2006. "On constraint qualifications with generalized convexity and optimality conditions," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00113148, HAL.
    • Handle: RePEc:hal:cesptp:halshs-00113148
    Note: View the original document on HAL open archive server: https://shs.hal.science/halshs-00113148
    as

    Download full text from publisher

    File URL: https://shs.hal.science/halshs-00113148/document
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. T. Illés & G. Kassay, 1999. "Theorems of the Alternative and Optimality Conditions for Convexlike and General Convexlike Programming," Journal of Optimization Theory and Applications, Springer, vol. 101(2), pages 243-257, May.
    Full references (including those not matched with items on IDEAS)

    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. Do Van Luu & Manh-Hung Nguyen, 2006. "On alternative theorems and necessary conditions for efficiency," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00112454, HAL.
    2. M. Ruiz Galán, 2016. "A sharp Lagrange multiplier theorem for nonlinear programs," Journal of Global Optimization, Springer, vol. 65(3), pages 513-530, July.
    3. Frenk, J.B.G. & Kassay, G. & Kolumban, J., 2002. "Equivalent Results in Minimax Theory," ERIM Report Series Research in Management ERS-2002-08-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    4. Adan, M. & Novo, V., 2003. "Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness," European Journal of Operational Research, Elsevier, vol. 149(3), pages 641-653, September.
    5. P. Montiel López & M. Ruiz Galán, 2016. "Nonlinear Programming via König’s Maximum Theorem," Journal of Optimization Theory and Applications, Springer, vol. 170(3), pages 838-852, September.
    6. P. H. Sach, 2007. "Moreau–Rockafellar Theorems for Nonconvex Set-Valued Maps," Journal of Optimization Theory and Applications, Springer, vol. 133(2), pages 213-227, May.
    7. J.B.G. Frenk & G. Kassay & J. Kolumbán, 2002. "Equivalent Results in MinimaxTheory," Tinbergen Institute Discussion Papers 02-009/4, Tinbergen Institute.
    8. Frenk, J. B. G. & Kassay, G. & Kolumban, J., 2004. "On equivalent results in minimax theory," European Journal of Operational Research, Elsevier, vol. 157(1), pages 46-58, August.
    9. Jiawei Chen & Elisabeth Köbis & Jen-Chih Yao, 2019. "Optimality Conditions and Duality for Robust Nonsmooth Multiobjective Optimization Problems with Constraints," Journal of Optimization Theory and Applications, Springer, vol. 181(2), pages 411-436, May.

    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:hal:cesptp:halshs-00113148. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.