Bitte verwenden Sie diesen Link, um diese Publikation zu zitieren, oder auf sie als Internetquelle zu verweisen: https://hdl.handle.net/10419/287346 
Erscheinungsjahr: 
2021
Quellenangabe: 
[Journal:] Journal of Global Optimization [ISSN:] 1573-2916 [Volume:] 83 [Issue:] 2 [Publisher:] Springer US [Place:] New York, NY [Year:] 2021 [Pages:] 329-357
Verlag: 
Springer US, New York, NY
Zusammenfassung: 
For a continuous multi-objective optimization problem, it is usually not a practical approach to compute all its nondominated points because there are infinitely many of them. For this reason, a typical approach is to compute an approximation of the nondominated set. A common technique for this approach is to generate a polyhedron which contains the nondominated set. However, often these approximations are used for further evaluations. For those applications a polyhedron is a structure that is not easy to handle. In this paper, we introduce an approximation with a simpler structure respecting the natural ordering. In particular, we compute a box-coverage of the nondominated set. To do so, we use an approach that, in general, allows us to update not only one but several boxes whenever a new nondominated point is found. The algorithm is guaranteed to stop with a finite number of boxes, each being sufficiently thin.
Schlagwörter: 
Multi-objective optimization
Approximation algorithm
Nondominated set
Enclosure
Box-coverage
JEL: 
C26
C29
C59
K05
Persistent Identifier der Erstveröffentlichung: 
Creative-Commons-Lizenz: 
cc-by Logo
Dokumentart: 
Article
Dokumentversion: 
Published Version

Datei(en):
Datei
Größe





Publikationen in EconStor sind urheberrechtlich geschützt.