Constraint qualification in a general class of Lipschitzian mathematical programming problems

DOI10.1007/s10898-006-9101-5zbMath1145.90101OpenAlexW2067640900MaRDI QIDQ2465488

Zi-Shuang Tong, Xiao Jin Zheng

Publication date: 4 January 2008

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-006-9101-5

zbMATH Keywords

Constraint qualificationsLipschitzian problemsGeneralized gradient

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52)

Related Items

Constraint qualifications in nonsmooth optimization: Classification and inter-relations

Cites Work

• Unnamed Item
• Optimality conditions for fractional minmax programming
• Necessary and sufficient conditions for minimax fractional programming
• A class of nondifferentiable mathematical programming problems
• Constraint qualifications in a class of nondifferentiable mathematical programming problems
• Optimization and nonsmooth analysis
• Convex Analysis