Structure of Efficient Sets for Convex Objectives

DOI10.1287/MOOR.14.2.249zbMath0673.90080OpenAlexW2057305555MaRDI QIDQ3827804

No author found.

Publication date: 1989

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.14.2.249

zbMATH Keywords

efficient setsquasi-efficient solutionsconvex vector minimization

Mathematics Subject Classification ID

Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31)

Related Items (10)

ANOVA-MOP: ANOVA Decomposition for Multiobjective Optimization ⋮ A new algorithm for solving planar multiobjective location problems involving the Manhattan norm ⋮ Algebra of efficient sets for multiobjective complex systems ⋮ Quasiconvex constrained multicriteria continuous location problems: structure of nondominated solution sets ⋮ Involving the Helly number in Pareto reducibility ⋮ A graphical characterization of the efficient set for convex multiobjective problems ⋮ The problem of the optimal biobjective spanning tree ⋮ On the structure of the weakly efficient set for quasiconvex vector minimization ⋮ Free disposal hull condition to verify when efficiency coincides with weak efficiency ⋮ A special class of extended multicriteria location problems

This page was built for publication: Structure of Efficient Sets for Convex Objectives