Numerical algorithms for generating an almost even approximation of the Pareto front in nonlinear multi-objective optimization problems

A multiobjective optimization problem (MOP) returns a set of non-dominated points, the so-called Pareto front. Since this set is usually infinite, it is impossible to generate it completely in practice. Therefore, a discrete approximation of the Pareto front is created. One of the most important fea...

Full description

Bibliographic Details

Published in:	Applied soft computing Vol. 165; p. 112001
Main Authors:	Dolatnezhadsomarin, Azam, Khorram, Esmaile, Yousefikhoshbakht, Majid
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.11.2024
Subjects:	Hyperplane Multi-objective optimization problem Pareto front Pareto optimal solution Pascoletti-Serafini scalarization approach Pareto optimal solution Pareto front Pascoletti-Serafini scalarization approach Multi-objective optimization problem Hyperplane
ISSN:	1568-4946
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!