Covers and approximations in multiobjective optimization
Vanderpooten, Daniel; Weerasena, L.; Wiecek, M.M. (2017), Covers and approximations in multiobjective optimization, Journal of Global Optimization, 67, 3, p. 601-619. 10.1007/s10898-016-0426-4
Type
Article accepté pour publication ou publiéDate
2017Journal name
Journal of Global OptimizationVolume
67Number
3Publisher
Springer
Pages
601-619
Publication identifier
Metadata
Show full item recordAuthor(s)
Vanderpooten, DanielLaboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Weerasena, L.
Wiecek, M.M.
Abstract (EN)
Due to the growing interest in approximation for multiobjective optimization problems (MOPs), a theoretical framework for defining and classifying sets representing or approximating solution sets for MOPs is developed. The concept of tolerance function is proposed as a tool for modeling representation quality. This notion leads to the extension of the traditional dominance relation to t-t- dominance. Two types of sets representing the solution sets are defined: covers and approximations. Their properties are examined in a broader context of multiple solution sets, multiple cones, and multiple quality measures. Applications to complex MOPs are included.Subjects / Keywords
Multiobjective optimization; Nondominated set; Pareto set; Approximation; Cones; Tolerance functionRelated items
Showing items related by title and author.
-
Jamain, Florian; Bazgan, Cristina; Vanderpooten, Daniel (2014) Communication / Conférence
-
Dächert, Kerstin; Klamroth, Kathrin; Lacour, Renaud; Vanderpooten, Daniel (2017) Article accepté pour publication ou publié
-
Klamroth, Kathrin; Lacour, Renaud; Vanderpooten, Daniel (2015) Article accepté pour publication ou publié
-
Aissi, Hassene; Bazgan, Cristina; Vanderpooten, Daniel (2007) Article accepté pour publication ou publié
-
Bazgan, Cristina; Jamain, Florian; Vanderpooten, Daniel (2017) Article accepté pour publication ou publié