Characterisations of efficient sets in vector optimisation
From MaRDI portal
Recommendations
- On efficient solutions in vector optimization
- A Characterization of Efficient and Weakly Efficient Points in Convex Vector Optimization
- Characterizations of efficiency in vector optimization with \(\mathcal C(T)\)-valued mappings
- Characterizations of efficient points in convex vector optimization problems
- Characterization of weakly efficient points
Cites work
Cited in
(11)- Vectorization in set optimization
- Characterization of efficient points of acceptance sets
- Characterizations of efficient points in convex vector optimization problems
- On essential sets and essential components of efficient solutions for vector optimization problems
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- Super efficient solutions and super infima in vector optimization
- Characterizations of efficiency in vector optimization with \(\mathcal C(T)\)-valued mappings
- Characterizing the efficient points without closedness or free-disposability
- Characterizations of solution sets of convex vector minimization problems
- Characterizations of efficient sets by constrained objectives
- A result on sets, with applications to vector optimization
This page was built for publication: Characterisations of efficient sets in vector optimisation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4835425)
