Introducing Nonpolyhedral Cones to Multiobjective Programming
From MaRDI portal
Publication:3649588
DOI10.1007/978-3-540-85646-7_4zbMath1176.90534OpenAlexW2203287611MaRDI QIDQ3649588
Margaret M. Wiecek, Alexander Engau
Publication date: 4 December 2009
Published in: Multiobjective Programming and Goal Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85646-7_4
Related Items (2)
On the effects of combining objectives in multi-objective optimization ⋮ Tradeoff-based decomposition and decision-making in multiobjective programming
Cites Work
- Nonconvex separation theorems and some applications in vector optimization
- Convex functions, monotone operators and differentiability.
- Theory of multiobjective optimization
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- Applications of second-order cone programming
- Existence of efficient solutions for vector maximization problems
- Order-preserving transformations and applications
- Full nuclear cones associated to a normal cone. Application to Pareto efficiency.
- Scalarizing vector optimization problems
- Interactive decision maps. Approximation and visualization of Pareto frontier
- Proper efficiency and the theory of vector maximization
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Relative importance of criteria: a quantitative approach
- Variational Analysis
- Multicriteria Optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Introducing Nonpolyhedral Cones to Multiobjective Programming
