Invexity in multifunction optimization

DOI10.1080/01630569108816436zbMath0724.90056OpenAlexW1991014520MaRDI QIDQ5202516

Pham Hu'u Sach, Bruce D.Craven

Publication date: 1991

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630569108816436

zbMATH Keywords

multifunctiontangent coneinvex functionsufficient Kuhn-Tucker conditionsnecessary Lagrangian conditions

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Related Items

Nonsmooth vector-valued invex functions and applications ⋮ Necessary conditions for extremality and separation theorems with applications to multiobjective optimization ⋮ Another characterization of convexity for set-valued maps ⋮ On locally Lipschitz vector-valued invex functions ⋮ Generalized invexity and duality theories with multifunctions ⋮ Invexity criteria for a class of vector-valued functions ⋮ A survey of recent[1985-1995advances in generalized convexity with applications to duality theory and optimality conditions] ⋮ Optimization with set-functions described by functions ⋮ Infine functions and nonsmooth multiobjective optimization problems ⋮ A note on quasiconvex set-valued maps. ⋮ Weak Clarke epiderivative in set-valued optimization ⋮ Characterization of scalar quasiconvexity and convexity of locally lipschitz vector-valued maps ⋮ A generl farkas type lemma ⋮ Optimality criteria in set-valued optimization ⋮ Generalized ( ,α, ρ, θ)–d–V–univex functions and non-smooth alternative theorems

Cites Work

• Unnamed Item
• Unnamed Item
• On sufficiency of the Kuhn-Tucker conditions
• Optimal solutions to differential inclusions
• Nonsmooth invexity
• On duality with generalized convexity
• Nondifferentiable optimization by smooth approximations
• What is invexity?
• Nonsmooth multiobjective programming
• Invex functions and constrained local minima
• Generalized invexity for nonsmooth vector-valued mappings