Invex optimisation problems

DOI10.1017/S0004972700011679zbMath0755.90072OpenAlexW2011764141MaRDI QIDQ3988185

Christian Malivert, Dinh The Luc

Publication date: 28 June 1992

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0004972700011679

zbMATH Keywords

vector optimizationoptimality conditionsinvexitycontingent derivatives of set-valued mapszero-gap duality property

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Set-valued functions (26E25) Duality theory (optimization) (49N15) Convexity of real functions of several variables, generalizations (26B25)

Related Items (17)

The Notion of V-r-Invexity in Differentiable Multiobjective Programming ⋮ Lagrangian multipliers, saddle points, and duality in vector optimization of set-valued maps ⋮ Subdifferentials of multifunctions and Lagrange multipliers for multiobjective optimization. ⋮ \(\varepsilon\)-subdifferentials of set-valued maps and \(\varepsilon\)-weak Pareto optimality for multiobjective optimization ⋮ Optimality conditions for \(C^{1,1}\) constrained multiobjective problems ⋮ A survey of recent[1985-1995advances in generalized convexity with applications to duality theory and optimality conditions] ⋮ Necessary optimality conditions for bilevel set optimization problems ⋮ Optimality conditions for a nonconvex set-valued optimization problem ⋮ A note on quasiconvex set-valued maps. ⋮ Set-valued derivatives of multifunctions and optimality conditions ⋮ Sufficient optimality conditions and duality theorems for set-valued optimization problem under generalized cone convexity ⋮ Unnamed Item ⋮ Optimality and Duality for Non-Lipschitz Multiobjective Optimization Problems ⋮ Benson proper efficiency in the vector optimization of set-valued maps ⋮ Optimality conditions for vector mathematical programming via a theorem of the alternative ⋮ Necessary optimality conditions for set-valued optimization problems via the extremal principle ⋮ Approximate solutions for nonconvex set-valued optimization and vector variational inequality

Cites Work

• Unnamed Item
• Multiobjective duality with invexity
• On sufficiency of the Kuhn-Tucker conditions
• Note on generalized convex functions
• Contingent derivatives of set-valued maps and applications to vector optimization
• Differentiability of Relations and Differential Stability of Perturbed Optimization Problems
• A modified wolfe dual for weak vector minimization
• What is invexity?
• Nonsmooth multiobjective programming
• Set-valued analysis

This page was built for publication: Invex optimisation problems