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

T. Illés and G. Kassay
Additional contact information
T. Illés: Eötvös Loránd University
G. Kassay: Babeş-Bolyai University

Journal of Optimization Theory and Applications, 1999, vol. 101, issue 2, No 1, 243-257

Abstract: 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.

Keywords: Convexlike functions; alternative theorems of Farkas type; duality theory; constrained optimization problems (search for similar items in EconPapers)
Date: 1999
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (12)

Downloads: (external link)
http://link.springer.com/10.1023/A:1021781308794 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1023/A:1021781308794

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

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