Constraint qualifications in a class of nondifferentiable mathematical programming problems

DOI10.1016/J.JMAA.2003.10.041zbMath1151.90578OpenAlexW1980854559MaRDI QIDQ1763795

Zengkun Xu

Publication date: 22 February 2005

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmaa.2003.10.041

zbMATH Keywords

Constraint qualificationsNecessary conditionsNondifferentiable problems

Mathematics Subject Classification ID

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

Related Items (6)

Minimax fractional programming under nonsmooth generalized \((\mathcal F,\rho, \theta)\)-d-univexity ⋮ Constraint qualifications in nonsmooth optimization: Classification and inter-relations ⋮ Constraint qualification in a general class of Lipschitzian mathematical programming problems ⋮ Constraint qualification in a general class of nondifferentiable mathematical programming problems ⋮ On necessary conditions for a class of nondifferentiable minimax fractional programming ⋮ Necessary optimality conditions for a class of nonsmooth vector optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimality conditions for fractional minmax programming
• Saddle-point type optimality criteria for generalized fractional programming
• A subgradient duality theorem
• Necessary and sufficient conditions for minimax fractional programming
• A class of nondifferentiable mathematical programming problems
• On a constraint qualification in a nondifferentiable programming problem

This page was built for publication: Constraint qualifications in a class of nondifferentiable mathematical programming problems