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

1. Auflage 2020
ISBN: 978-3-658-29148-8
Verlag: Springer

Buch, Englisch, 70 Seiten, Format (B × H): 148 mm x 210 mm, Gewicht: 131 g

Reihe: BestMasters

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.

Zielgruppe

Research

Autoren/Hrsg.

Rocktäschel, Stefan

Fachgebiete

• Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Angewandte Mathematik, Mathematische Modelle

Inhaltsverzeichnis

Theoretical basics for solving multiobjective mixed-integer convex optimization problems.- An algorithm for solving this class of optimization problems.- Test instances and numerical results.

Über Autor(innen)

Stefan Rocktäschel works as scientific assistant at the Institute for Mathematics of Technische Universität Ilmenau, Germany.