A new approach to approximate the bounded Pareto front

DOI10.1007/s00186-015-0510-4zbMath1335.90088OpenAlexW999416671MaRDI QIDQ890180

Kazhal Khaledian, Majid Soleimani-damaneh

Publication date: 9 November 2015

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

Full work available at URL: https://doi.org/10.1007/s00186-015-0510-4

zbMATH Keywords

Pareto frontmultiple-objective optimizationNBI methodboundary of the Pareto frontindifferent regions

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Related Items

Two efficient algorithms for constructing almost even approximations of the Pareto front in multi-objective optimization problems, Anchor points in multiobjective optimization: definition, characterization and detection, A New Scalarization Technique and New Algorithms to Generate Pareto Fronts

Uses Software

• NBI

Cites Work

• A numerical method for constructing the Pareto front of multi-objective optimization problems
• Scalarizing vector optimization problems
• A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems
• Adaptive Scalarization Methods in Multiobjective Optimization
• A Successive Approach to Compute the Bounded Pareto Front of Practical Multiobjective Optimization Problems
• Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems