Two techniques to reduce the Pareto optimal solutions in multiobjective optimization problems

DOI10.22049/CCO.2024.28753.1700MaRDI QIDQ6917327zbMATH OpenFDO

Authors Fatemeh Ahmadi, Davoud Foroutannia

Publication date 13 October 2025

Published in Communications in Combinatorics and Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution-ShareAlike 4.0 International

Full work available at URL https://doi.org/10.22049/CCO.2024.28753.1700

zbMATH Keywords

Paretomultiobjective programmingnondominated\(A_p\)-efficiency

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Multi-objective and goal programming (90C29) Individual preferences (91B08)

Cites work

• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• A post-optimality analysis algorithm for multi-objective optimization
• Cone characterizations of approximate solutions in real vector optimization
• Generalized rationnal efficiency in multiobjective programming
• Linear optimization with multiple equitable criteria
• Minimax reference point approach and its application for multiobjective optimisation
• On the effects of combining objectives in multi-objective optimization
• Preference relation with interval value tradeoffs in criterion space
• Pruning Pareto optimal solutions for multi-objective portfolio asset management
• Quantitative importance of criteria
• Relative importance of criteria in multiobjective programming: a cone-based approach
• Relative importance of criteria: a quantitative approach
• g-dominance: Reference point based dominance for multiobjective metaheuristics

This page was built for publication: Two techniques to reduce the Pareto optimal solutions in multiobjective optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6917327)