A new class of generalized convex programming

DOI10.1007/BF02936061zbMath1138.90444OpenAlexW2092090984MaRDI QIDQ1767394

Shizheng Li, Zhaoxiang Yan

Publication date: 10 March 2005

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Convex programming (90C25)

Cites Work

• Unnamed Item
• The essence of invexity
• Optimality criteria in mathematical programming involving generalized invexity
• On sufficiency of the Kuhn-Tucker conditions
• Strong convexity of sets and functions
• On efficiency and duality for multiobjective programs
• B-vex functions
• Generalization of preinvex and B-vex functions
• Strong and Weak Convexity of Sets and Functions
• Necessary and sufficient conditions in constrained optimization
• Further Generalizations of Convexity in Mathematical Programming

This page was built for publication: A new class of generalized convex programming