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 OptimizationConclusion

A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization: Conclusion [In this book, we have considered multiobjective mixed-integer convex optimization problems. We introduced basic definitions and concepts of multiobjective optimization. We derived a basic Branch-and-Bound algorithm for solving (MOMICP) by using approaches from global multiobjective (continuous) optimization [16].] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex OptimizationConclusion

Download PDF
0 pages

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

Abstract

[In this book, we have considered multiobjective mixed-integer convex optimization problems. We introduced basic definitions and concepts of multiobjective optimization. We derived a basic Branch-and-Bound algorithm for solving (MOMICP) by using approaches from global multiobjective (continuous) optimization [16].]

Published: Jan 22, 2020

There are no references for this article.