• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail - Request a copy

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
2017
Journal name
Journal of Global Optimization
Volume
67
Number
3
Publisher
Springer
Pages
601-619
Publication identifier
10.1007/s10898-016-0426-4
Metadata
Show full item record
Author(s)
Vanderpooten, Daniel
Laboratoire 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 function
JEL
C44 - Operations Research; Statistical Decision Theory

Related items

Showing items related by title and author.

  • Thumbnail
    Approximation in multiobjective optimization using e-kernels 
    Jamain, Florian; Bazgan, Cristina; Vanderpooten, Daniel (2014) Communication / Conférence
  • Thumbnail
    Efficient computation of the search region in multi-objective optimization 
    Dächert, Kerstin; Klamroth, Kathrin; Lacour, Renaud; Vanderpooten, Daniel (2017) Article accepté pour publication ou publié
  • Thumbnail
    On the representation of the search region in multi-objective optimization 
    Klamroth, Kathrin; Lacour, Renaud; Vanderpooten, Daniel (2015) Article accepté pour publication ou publié
  • Thumbnail
    Approximation of min-max and min-max regret versions of some combinatorial optimization problems 
    Aissi, Hassene; Bazgan, Cristina; Vanderpooten, Daniel (2007) Article accepté pour publication ou publié
  • Thumbnail
    Discrete representation of the non-dominated set for multi-objective optimization problems using kernels 
    Bazgan, Cristina; Jamain, Florian; Vanderpooten, Daniel (2017) Article accepté pour publication ou publié
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo