Constraint qualification in a general class of nondifferentiable mathematical programming problems

The Kuhn–Tucker type necessary optimality conditions are given for the problem of minimizing a local Lipschitzian function subject to a set of differentiable nonlinear inequalities on a convex subset C of R n , under the conditions of the generalized Kuhn–Tucker constraint qualification or the gener...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computers & mathematics with applications (1987) Jg. 53; H. 1; S. 21 - 27
Hauptverfasser: Zheng, Xiaojin, Xu, Zengkun, Li, Cheng
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier Ltd 2007
Schlagworte:
ISSN:0898-1221, 1873-7668
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The Kuhn–Tucker type necessary optimality conditions are given for the problem of minimizing a local Lipschitzian function subject to a set of differentiable nonlinear inequalities on a convex subset C of R n , under the conditions of the generalized Kuhn–Tucker constraint qualification or the generalized Arrow–Hurwicz–Uzawa constraint qualification. The case when the set C is open is shown to be a special one of our results, which helps us to improve some of the existing results in the literature. What’s more, the case when the object function is the sum of a differentiable function and a convex function is also the special case of our results. Finally, the case when the object function is the quotient of two Lipschitz functions is the special case of our results too.
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0898-1221
1873-7668
DOI:10.1016/j.camwa.2006.05.018