Structure of Efficient Sets for Convex Objectives
From MaRDI portal
Recommendations
Cited in
(19)- A new algorithm for solving planar multiobjective location problems involving the Manhattan norm
- The problem of the optimal biobjective spanning tree
- Free disposal hull condition to verify when efficiency coincides with weak efficiency
- A graphical characterization of the efficient set for convex multiobjective problems
- On the structure of the weakly efficient set for quasiconvex vector minimization
- Quasiconvex constrained multicriteria continuous location problems: structure of nondominated solution sets
- Properties of efficient solution sets under addition of objectives
- scientific article; zbMATH DE number 3982929 (Why is no real title available?)
- scientific article; zbMATH DE number 2016168 (Why is no real title available?)
- ANOVA-MOP: ANOVA decomposition for multiobjective optimization
- scientific article; zbMATH DE number 791044 (Why is no real title available?)
- scientific article; zbMATH DE number 824551 (Why is no real title available?)
- A special class of extended multicriteria location problems
- Algebra of efficient sets for multiobjective complex systems
- A Generalization of the Concept of Proper Efficiency in the Decomposed Multi-Objective Optimization Problems
- Decision space decomposition for multiobjective optimization
- Existence of weak Pareto efficient solutions of a multiobjective optimization problem under a closed constraint set
- Characterizations of efficient sets by constrained objectives
- Involving the Helly number in Pareto reducibility
This page was built for publication: Structure of Efficient Sets for Convex Objectives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3827804)
