Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/307034 
Year of Publication: 
2023
Citation: 
[Journal:] Journal of Global Optimization [ISSN:] 1573-2916 [Volume:] 87 [Issue:] 1 [Publisher:] Springer US [Place:] New York, NY [Year:] 2023 [Pages:] 97-132
Publisher: 
Springer US, New York, NY
Abstract: 
In this paper, a new method for computing an enclosure of the nondominated set of multiobjective mixed-integer quadratically constrained programs without any convexity requirements is presented. In fact, our criterion space method makes use of piecewise linear relaxations in order to bypass the nonconvexity of the original problem. The method chooses adaptively which level of relaxation is needed in which parts of the image space. Furthermore, it is guaranteed that after finitely many iterations, an enclosure of the nondominated set of prescribed quality is returned. We demonstrate the advantages of this approach by applying it to multiobjective energy supply network problems.
Subjects: 
Mixed-integer nonlinear programming
Multiobjective optimization
Box enclosure
Adaptive piecewise linear relaxation
Energy supply networks
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.