A non-differentiable programming problem under strong pseudoinvexity.

DOI10.1007/BF03398703zbMath1151.90553OpenAlexW2772595482MaRDI QIDQ2477108

Yanyan Li

Publication date: 13 March 2008

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03398703

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimality conditions for a class of non-differentiable mathematical programming problems
• A class of nondifferentiable mathematical programming problems
• Duality for nonlinear programming problems with strong pseudoinvexity constraints
• The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
• A duality theorem for non-linear programming
• Optimality Criteria for a Class of Non‐differentiable Mathematical Programs

This page was built for publication: A non-differentiable programming problem under strong pseudoinvexity.