Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex OptimizationA basic Branch-and-Bound algorithm for (MOMICP)

A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization: A basic... [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.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex OptimizationA basic Branch-and-Bound algorithm for (MOMICP)

Download PDF
22 pages

Loading next page...
 
/lp/springer-journals/a-branch-and-bound-algorithm-for-multiobjective-mixed-integer-convex-yEcZZtLp3q
Publisher
Springer Fachmedien Wiesbaden
Copyright
© Springer Fachmedien Wiesbaden GmbH, part of Springer Nature 2020
ISBN
978-3-658-29148-8
Pages
17 –39
DOI
10.1007/978-3-658-29149-5_3
Publisher site
See Chapter on Publisher Site

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.]

Published: Jan 22, 2020

There are no references for this article.