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:	Constraint qualifications Fractional programming Generalized gradient Inequalities Mathematical analysis Mathematical models Mathematical programming Necessary optimality conditions Nondifferentiable problems Nonlinearity Optimization Quotients Nondifferentiable problems Necessary optimality conditions Fractional programming Generalized gradient Constraint qualifications
ISSN:	0898-1221, 1873-7668
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!