Pareto reducible multicriteria optimization problems

DOI10.1080/02331930500096213zbMath1087.90070OpenAlexW2017426747MaRDI QIDQ5466708

Nicolae Popovici

Publication date: 25 August 2005

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930500096213

zbMATH Keywords

multicriteria optimizationPareto reducibilitycone-radiant sets

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29)

Related Items

Relationships between constrained and unconstrained multi-objective optimization and application in location theory, ANOVA-MOP: ANOVA Decomposition for Multiobjective Optimization, A decomposition approach to vector equilibrium problems, On the existence of weak efficient solutions of nonconvex vector optimization problems, On the hierarchical structure of Pareto critical sets, A new algorithm for solving planar multiobjective location problems involving the Manhattan norm, Algebra of efficient sets for multiobjective complex systems, Traffic assignment: on the interplay between optimization and equilibrium problems, Decomposition of generalized vector variational inequalities, Involving the Helly number in Pareto reducibility, Explicitly quasiconvex set-valued optimization, Traffic assignment: methods and simulations for an alternative formulation of the fixed demand problem, Arcwise cone-quasiconvex multicriteria optimization, Free disposal hull condition to verify when efficiency coincides with weak efficiency, Scalarization and decomposition of vector variational inequalities governed by bifunctions, Tradeoff-based decomposition and decision-making in multiobjective programming, A special class of extended multicriteria location problems, Unnamed Item, Robust aspects of solutions in deterministic multiple objective linear programming, Arcwise connected cone-quasiconvex set-valued mappings and Pareto reducibility in vector optimization

Cites Work

• Unnamed Item
• The structure of the efficient frontier of finite-dimensional completely-shaded sets
• Contractibility of efficient frontier of simply shaded sets
• On Efficient Solutions to Multiple Objective Mathematical Programs
• Topologies on lattice ordered groups, separation from closed downward sets and conjugations of type Lau
• Contractibility of the efficient frontier of three-dimensional simply-shaded sets.