Norm-based approximation in \(E\)-\([0,1]\) convex multi-objective programming
From MaRDI portal
Publication:2410884
DOI10.1007/s10092-015-0170-zzbMath1372.90081OpenAlexW2464984714MaRDI QIDQ2410884
Publication date: 19 October 2017
Published in: Calcolo (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10092-015-0170-z
approximationblock normsnondominated points\(E\)-\([0,1\) convex multiobjective]
Convex programming (90C25) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Characterization of efficient solutions for multi-objective optimization problems involving semi-strong and generalized semi-strong \(E\)-convexity
- Norm-based approximation in multicriteria programming.
- Introducing oblique norms into multiple criteria programming
- Scalarizing vector optimization problems
- Optimality for \(E\text{-}[0,1\) convex multi-objective programming problems]
This page was built for publication: Norm-based approximation in \(E\)-\([0,1]\) convex multi-objective programming