Constraint qualification in a general class of nondifferentiable mathematical programming problems

DOI10.1016/j.camwa.2006.05.018zbMath1129.90058OpenAlexW2035876270MaRDI QIDQ2469910

Cheng Li, Zengkun Xu, Xiao Jin Zheng

Publication date: 11 February 2008

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2006.05.018

zbMATH Keywords

necessary optimality conditionsfractional programmingconstraint qualificationsgeneralized gradientnondifferentiable problems

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Fractional programming (90C32)

Related Items (1)

Minimax fractional programming under nonsmooth generalized \((\mathcal F,\rho, \theta)\)-d-univexity

Cites Work

• Unnamed Item
• 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

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