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

Stefan Rocktäschel (Autor)

Buch | Softcover

VIII, 70 Seiten

2020 | 1st ed. 2020
Springer Fachmedien Wiesbaden GmbH (Verlag)
978-3-658-29148-8 (ISBN)

Artikel merken

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.

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

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

Erscheinungsdatum	24.01.2020
Reihe/Serie	BestMasters
Zusatzinfo	VIII, 70 p. 15 illus.
Verlagsort	Wiesbaden
Sprache	englisch
Maße	148 x 210 mm
Gewicht	158 g
Themenwelt	Mathematik / Informatik ► Mathematik ► Analysis
Themenwelt	Mathematik / Informatik ► Mathematik ► Angewandte Mathematik
Schlagworte	algorithm • Branch-and-bound • Convex • Mixed Integer Programming • Multiobjective Programming • Nonlinear • Optimization
ISBN-10	3-658-29148-6 / 3658291486
ISBN-13	978-3-658-29148-8 / 9783658291488
Zustand	Neuware