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

Full description

Saved in:

Bibliographic Details
Published in:	Computers & mathematics with applications (1987) Vol. 53; no. 1; pp. 21 - 27
Main Authors:	Zheng, Xiaojin, Xu, Zengkun, Li, Cheng
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 2007
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!