Abstract
In this Chapter, we discuss an extension of the proposed algorithm to the nonconvex case. Therefore, we introduce the concept of convex underestimators. As we have seen in Example 2.13, the assumption of convexity of f and g for (MOMICP) in Assumption 2.9 can be very restricting.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2020 Springer Fachmedien Wiesbaden GmbH, part of Springer Nature
About this chapter
Cite this chapter
Rocktäschel, S. (2020). Outlook and further possible improvements. In: A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization. BestMasters. Springer Spektrum, Wiesbaden. https://doi.org/10.1007/978-3-658-29149-5_6
Download citation
DOI: https://doi.org/10.1007/978-3-658-29149-5_6
Published:
Publisher Name: Springer Spektrum, Wiesbaden
Print ISBN: 978-3-658-29148-8
Online ISBN: 978-3-658-29149-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)