Generalized invexity-type conditions in constrained optimization

DOI10.1007/s11424-011-8234-xzbMath1254.90234OpenAlexW1973696684MaRDI QIDQ646771

Norma G. Rueda, Shashi Kant Mishra

Publication date: 17 November 2011

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-011-8234-x

zbMATH Keywords

constrained optimizationtype I functionsduality results

Mathematics Subject Classification ID

Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)

Related Items (3)

Semistrict \(G\)-preinvexity and optimality in nonlinear programming ⋮ Integral majorization theorem for invex functions ⋮ Hardy-Littlewood-Pólya-type theorems for invex functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The essence of invexity
• Invexity and optimization
• Optimality criteria in mathematical programming involving generalized invexity
• On sufficiency of the Kuhn-Tucker conditions
• A simple solution of the van der Waerden permanent problem
• On invexity-type nonlinear programming problems
• Optimality criteria and duality in multiple-objective optimization involving generalized invexity
• Necessary and sufficient conditions in constrained optimization
• A survey of recent[1985-1995advances in generalized convexity with applications to duality theory and optimality conditions]

This page was built for publication: Generalized invexity-type conditions in constrained optimization