Theorems of the alternative and optimality conditions for convexlike and general convexlike programming

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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of optimization theory and applications 1999-05, Vol.101 (2), p.243-257
Hauptverfasser:	ILLES, T, KASSAY, G
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Exact sciences and technology Operational research and scientific management Operational research. Management science Optimization. Search problems
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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, Zalinescu, and a recent result of Tamminen.
ISSN:	0022-3239 1573-2878
DOI:	10.1023/A:1021781308794