IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v101y1999i2d10.1023_a1021781308794.html
   My bibliography  Save this article

Theorems of the Alternative and Optimality Conditions for Convexlike and General Convexlike Programming

Author

Listed:
  • T. Illés

    (Eötvös Loránd University)

  • G. Kassay

    (Babeş-Bolyai University)

Abstract

A general alternative theorem for convexlike functions is given. This permits the establishment of optimality conditions for convexlike programming problems in which both inequality and equality constraints are considered. It is shown that the main results of the paper contain, in particular, those of Craven, Giannessi, Jeyakumar, Hayashi, and Komiya, Simons, Zălinescu, and a recent result of Tamminen.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:joptap:v:101:y:1999:i:2:d:10.1023_a:1021781308794
    DOI: 10.1023/A:1021781308794
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1021781308794
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1021781308794?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

    for a different version of it.

    References listed on IDEAS

    as
    1. Illés, T. & Kassay, G., 1994. "Farkas type theorems for generalized convexities," Pure Mathematics and Applications, Department of Mathematics, Corvinus University of Budapest, vol. 5(2), pages 225-239.
    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. Manh Hung Nguyen & Do Van Luu, 2006. "On constraint qualifications with generalized convexity and optimality conditions," Cahiers de la Maison des Sciences Economiques b06020, Université Panthéon-Sorbonne (Paris 1).
    2. 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.
    3. 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.
    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. 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.
    6. 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.
    7. 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.
    8. 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.
    9. J.B.G. Frenk & G. Kassay & J. Kolumbán, 2002. "Equivalent Results in MinimaxTheory," Tinbergen Institute Discussion Papers 02-009/4, Tinbergen Institute.
    10. 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.

    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. Carrizosa, E. & Frenk, J.B.G., 1996. "Dominating Sets for Convex Functions with some Applications," Econometric Institute Research Papers EI 9657-/A, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    2. J.B.G. Frenk & G. Kassay, 1997. "On Classes of Generalized Convex Functions, Farkas-Type Theorems and Lagrangian Duality," Tinbergen Institute Discussion Papers 97-121/4, Tinbergen Institute.
    3. R. N. Mukherjee & L. V. Reddy, 1997. "Semicontinuity and Quasiconvex Functions," Journal of Optimization Theory and Applications, Springer, vol. 94(3), pages 715-726, September.
    4. E. Carrizosa & J. B. G. Frenk, 1998. "Dominating Sets for Convex Functions with Some Applications," Journal of Optimization Theory and Applications, Springer, vol. 96(2), pages 281-295, February.
    5. Giorgio Giorgi, 2014. "Again on the Farkas Theorem and the Tucker Key Theorem Proved Easily," DEM Working Papers Series 094, University of Pavia, Department of Economics and Management.
    6. G. Mastroeni & T. Rapcsák, 2000. "On Convex Generalized Systems," Journal of Optimization Theory and Applications, Springer, vol. 104(3), pages 605-627, March.
    7. J. B. G. Frenk & G. Kassay, 1999. "On Classes of Generalized Convex Functions, Gordan–Farkas Type Theorems, and Lagrangian Duality," Journal of Optimization Theory and Applications, Springer, vol. 102(2), pages 315-343, August.
    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.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:joptap:v:101:y:1999:i:2:d:10.1023_a:1021781308794. 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.