Abstract
In this chapter, we introduce a basic algorithm for computing a ’good’ cover of the efficient set of (MOMICP). The algorithm illustrates the basic procedure that we use. The idea of this Branch-and-Bound algorithm is to iteratively split the initial box B into smaller subboxes and derive lower and upper bounds for respective subproblems.
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
Preview
Unable to display preview. Download preview PDF.
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). A basic Branch-and-Bound algorithm for (MOMICP). 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_3
Download citation
DOI: https://doi.org/10.1007/978-3-658-29149-5_3
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)