Generalized constraint qualifications and optimality conditions for set-valued optimization problems
From MaRDI portal
The author introduces four generalized constraint qualifications and the connections between them are outlined in two theorems. These are used to derive Kuhn-Tucker type sufficient and necessary conditions for set-valued optimization problems with constraints, in terms of contigent epiderivatives introduced by \textit{J. Jahn} and \textit{R. Rauh} [Math. Methods Oper. Res. 46, 193--211 (1977; Zbl 0889.90123)].
Recommendations
- On some constraint qualification conditions in set-valued optimization
- Optimality conditions for set-valued optimization problems
- GENERALIZED CONTINGENT EPIDERIVATIVES IN SET-VALUED OPTIMIZATION: OPTIMALITY CONDITIONS
- scientific article; zbMATH DE number 7351021
- scientific article; zbMATH DE number 5059973
Cites work
- A theorem of the alternative and its application to the optimization of set-valued maps
- Benson proper efficiency in the vector optimization of set-valued maps
- Characterizations of the Benson proper efficiency for nonconvex vector optimization
- Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems
- Contingent derivatives of set-valued maps and applications to vector optimization
- Contingent epiderivatives and set-valued optimization
- Directional derivatives for set-valued mappings and applications
- Dualization of subgradient conditions for optimality
- Generalized convexity of functions and generalized monotonicity of set-valued maps
- scientific article; zbMATH DE number 3901504 (Why is no real title available?)
- scientific article; zbMATH DE number 4044567 (Why is no real title available?)
- scientific article; zbMATH DE number 3320765 (Why is no real title available?)
- Optimality conditions for maximizations of set-valued functions
- Optimality conditions for set-valued optimization problems
- Optimization of set-valued functions
- Set-valued analysis
- The optimality conditions of differentiable vector optimization problems
- Theorems of the alternative and optimality conditions for convexlike and general convexlike programming
Cited in
(10)- Kuhn-Tucker condition and Wolfe duality of preinvex set-valued optimization
- Optimality conditions of the set-valued optimization problem with generalized cone convex set-valued maps characterized by contingent epiderivative
- First-order optimality conditions in set-valued optimization
- On some constraint qualification conditions in set-valued optimization
- scientific article; zbMATH DE number 592635 (Why is no real title available?)
- scientific article; zbMATH DE number 6178237 (Why is no real title available?)
- On Generalized Gradients in Optimization Problems with Set-Valued Constraints
- PARAMETRIC SET-VALUED OPTIMIZATION PROBLEMS UNDER GENERALIZED CONE CONVEXITY
- Globally proper efficiency of set-valued optimization and vector variational inequality involving the generalized contingent epiderivative
- About contingent epiderivatives
This page was built for publication: Generalized constraint qualifications and optimality conditions for set-valued optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5957732)
