Some characterizations of solution sets of vector optimization problems with generalized order
From MaRDI portal
Publication:505589
DOI10.1007/s40306-015-0162-8zbMath1355.90104OpenAlexW2230425907MaRDI QIDQ505589
Publication date: 26 January 2017
Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40306-015-0162-8
connectednessvector optimizationclosednessgeneralized ordernecessary and sufficient optimality condition
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Sensitivity, stability, parametric optimization (90C31)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parametrized multicriteria optimization: Continuity and closedness of optimal multifunctions
- On the concept of generalized order optimality
- Theory of multiobjective optimization
- The domination property in multicriteria optimization
- A note on lower semicontinuity of minimal points
- Existence theorems in vector optimization with generalized order
- Continuity of minimal points with applications to parametric multiple objective optimization
- A note on connectivity of efficient solution sets
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Stability analysis for parametric vector optimization problems
- Structure of the Efficient Point Set
- Connectivity of efficient solution sets in vector optimization of set-valued mappings
- Berge-type theorems for vector optimization problems
- Subdifferential necessary conditions in set-valued optimization problems with equilibrium constraints
- Contractibility of efficient point sets in normed spaces
- Efficient sets of convex compacta are arcwise connected
This page was built for publication: Some characterizations of solution sets of vector optimization problems with generalized order
