Characterizations of efficiency in vector optimization with C(T)-valued mappings
From MaRDI portal
Publication:2017841
Recommendations
- A Characterization of Efficient and Weakly Efficient Points in Convex Vector Optimization
- Characterizations of efficient and weakly efficient points in nonconvex vector optimization
- Characterizations of super efficiency in cone-convexlike vector optimization with set-valued maps
- Characterisations of efficient sets in vector optimisation
- Nearly subconvexlike set-valued maps and vector optimization problems
Cites Work
- scientific article; zbMATH DE number 2063780 (Why is no real title available?)
- A Characterization of Efficient and Weakly Efficient Points in Convex Vector Optimization
- Characterizations of efficient points in convex vector optimization problems
- Convex Analysis
- Efficiency and generalized concavity
- Generalized convexity of functions and generalized monotonicity of set-valued maps
- Generalized monotonicity and convexity of non-differentiable functions
- Geometrical characterization of weakly efficient points
- Optimization and nonsmooth analysis
- Vector variational-like inequality with pseudoinvexity
This page was built for publication: Characterizations of efficiency in vector optimization with \(\mathcal C(T)\)-valued mappings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2017841)