Complete efficiency and interdependencies between objective functions in vector optimization
From MaRDI portal
Publication:3470265
DOI10.1007/BF01415973zbMath0694.90093MaRDI QIDQ3470265
No author found.
Publication date: 1990
Published in: [https://portal.mardi4nfdi.de/entity/Q3031760 ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research] (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01415973
polyhedral cones; linear spaces; weak efficiency; Vector optimization; general domination sets; Pareto- optimality; perturbed objective functions
90C31: Sensitivity, stability, parametric optimization
Related Items
Nonconvex separation theorems and some applications in vector optimization, Cone characterizations of approximate solutions in real vector optimization, New algorithms for discrete vector optimization based on the Graef-Younes method and cone-monotone sorting functions, ε-approximate solutions in multiobjective optimization
Cites Work
- Theory of multiobjective optimization
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- On the characterization of efficient points by means of monotone functionals
- Testing for complete efficiency in a vector maximization problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item