A numerical method for constructing the Pareto front of multi-objective optimization problems
DOI10.1016/j.cam.2013.11.007zbMath1278.90359OpenAlexW2016418196MaRDI QIDQ390465
M. Khaledyan, Esmaile Khorram, Kazhal Khaledian
Publication date: 8 January 2014
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2013.11.007
multi-objective optimizationnonlinear optimizationnonconvex optimizationPareto frontPascoletti and Serafini scalarization
Numerical mathematical programming methods (65K05) Multi-objective and goal programming (90C29) Nonlinear programming (90C30)
Related Items (9)
Uses Software
Cites Work
- Scalarizations for adaptively solving multi-objective optimization problems
- Generating \(\varepsilon\)-efficient solutions in multiobjective programming
- Generating the weakly efficient set of nonconvex multiobjective 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
- Multiobjective Optimization Through a Series of Single-Objective Formulations
- An Adaptive Scalarization Method in Multiobjective Optimization
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- Scalarizing Functions for Generating the Weakly Efficient Solution Set in Convex Multiobjective Problems
- Unnamed Item
- Unnamed Item
This page was built for publication: A numerical method for constructing the Pareto front of multi-objective optimization problems