Invex optimisation problems

DOI10.1017/S0004972700011679MaRDI QIDQ3988185zbMATH OpenOpenAlexFDO

Authors Dinh The Luc, Christian Malivert

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

optimality conditionsvector optimizationinvexitycontingent derivatives of set-valued mapszero-gap duality property

Mathematics Subject Classification ID

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

Recommendations

• Optimality condition and Wolfe duality for invex interval-valued nonlinear programming problems
• Invex multifunctions and duality
• Invexity and optimization
• scientific article; zbMATH DE number 7083230
• Duality and sufficiency in control problems with invexity

Cites work

• scientific article; zbMATH DE number 3926624 (Why is no real title available?)
• A modified wolfe dual for weak vector minimization
• Contingent derivatives of set-valued maps and applications to vector optimization
• Differentiability of Relations and Differential Stability of Perturbed Optimization Problems
• Multiobjective duality with invexity
• Nonsmooth multiobjective programming
• Note on generalized convex functions
• On sufficiency of the Kuhn-Tucker conditions
• Set-valued analysis
• What is invexity?

Cited in

(17)

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

This page was built for publication: Invex optimisation problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3988185)