Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/287346 
Year of Publication: 
2021
Citation: 
[Journal:] Journal of Global Optimization [ISSN:] 1573-2916 [Volume:] 83 [Issue:] 2 [Publisher:] Springer US [Place:] New York, NY [Year:] 2021 [Pages:] 329-357
Publisher: 
Springer US, New York, NY
Abstract: 
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.
Subjects: 
Multi-objective optimization
Approximation algorithm
Nondominated set
Enclosure
Box-coverage
JEL: 
C26
C29
C59
K05
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article
Document Version: 
Published Version

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.