Involving the Helly number in Pareto reducibility

DOI10.1016/j.orl.2007.09.002zbMath1163.90736OpenAlexW1981218354MaRDI QIDQ935211

Nicolae Popovici

Publication date: 6 August 2008

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2007.09.002

zbMATH Keywords

multicriteria optimizationHelly numberPareto reducibilitylexicographic quasiconvex functions

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Related Items (4)

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 ⋮ Robust aspects of solutions in deterministic multiple objective linear programming

Cites Work

• Unnamed Item
• Unnamed Item
• On the number of criteria needed to decide Pareto optimality
• The structure of the efficient frontier of finite-dimensional completely-shaded sets
• On Efficient Solutions to Multiple Objective Mathematical Programs
• Structure of Efficient Sets for Convex Objectives
• A characterization of quasiconvex vector-valued functions
• Pareto reducible multicriteria optimization problems

This page was built for publication: Involving the Helly number in Pareto reducibility