A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
Stefan Rocktäschel introduces a branch-and-bound algorithm that determines a cover of the efficient set of multiobjective mixed-integer convex optimization problems. He examines particular steps of this algorithm in detail and enhances the basic algorithm with additional modifications that ensure a more precise cover of the efficient set. Finally, he gives numerical results on some test instances.
| Autor: | Rocktäschel, Stefan |
|---|---|
| ISBN: | 9783658291488 |
| Sprache: | Englisch |
| Seitenzahl: | 70 |
| Produktart: | Kartoniert / Broschiert |
| Verlag: | Springer Fachmedien Wiesbaden GmbH |
| Veröffentlicht: | 22.01.2020 |
| Schlagworte: | Algorithm Branch-and-Bound Convex Mixed Integer Programming Multiobjective Programming Nonlinear Optimization |
Stefan Rocktäschel works as scientific assistant at the Institute for Mathematics of Technische Universität Ilmenau, Germany.