Optimization problems with difference of set-valued maps under generalized cone convexity
From MaRDI portal
Recommendations
- Sufficient optimality conditions and duality theorems for set-valued optimization problem under generalized cone convexity
- Set-valued minimax programming problems under generalized cone convexity
- Set-valued optimization problems under cone convexity
- Optimality conditions for global efficient solution of set-valued optimization problem with generalized cone-convex set-valued maps
- Set-valued fractional programming problems under generalized cone convexity
Cited in
(12)- Epidifferentiability and hypodifferentiability of pseudoconvex maps in set-optimization problems
- Sufficient optimality conditions and duality theorems for set-valued optimization problem under generalized cone convexity
- Set-valued optimization problems via second-order contingent epiderivative
- Set-valued optimization problems under cone convexity
- PARAMETRIC SET-VALUED OPTIMIZATION PROBLEMS UNDER GENERALIZED CONE CONVEXITY
- On constrained set-valued optimization problems with \(\rho\)-cone arcwise connectedness
- scientific article; zbMATH DE number 7716263 (Why is no real title available?)
- scientific article; zbMATH DE number 7731187 (Why is no real title available?)
- Cone arcwise connectivity in optimization problems with difference of set-valued mappings
- Optimal conditions in uncertain set-valued optimization problems via second-order subdifferential involving Minkowski difference with application to zero-sum matrix games
- Optimality conditions for the difference of convex set-valued mappings
- Prederivatives of convex set-valued maps and applications to set optimization problems
This page was built for publication: Optimization problems with difference of set-valued maps under generalized cone convexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5360739)