 |
Universität Augsburg
|
|
|
Universität Augsburg
|
|
Professor Dr. Oliver Stein
Karlsruher Institut für Technologie
spricht am
Dienstag, 16. Januar 2024
um
17:30 Uhr
im
Raum 2004 (L1)
über das Thema:
| Abstract: |
| The talk explains a recently developed general framework for branch-and-bound methods in multiobjective optimization. It may be applied to continuous as well as to mixed-integer convex and nonconvex multiobjective problems and actually yields the first deterministic method for the mixed-integer nonconvex case. After providing summaries of some main ideas in branch-and-bound and in multiobjective optimization, the talk focuses on natural generalizations of notions and techniques from the single objective to the multiobjective case, such as upper and lower bounds, discarding tests, node selection and, most importantly, a gap-based termination criterion. As a central tool we discuss convergent enclosures for the set of nondominated points and their limiting behavior. Numerical results for two and three objective functions illustrate this approach. |
| Hierzu ergeht herzliche Einladung. |
| Prof. Dr. Mirjam Dür |
Kaffee, Tee und Gebäck eine halbe Stunde vor Vortragsbeginn im Raum 2006 (L1).