Details

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

BestMasters

von: Stefan Rocktäschel
53,49 €
Verlag:	Spektrum Akademischer Verlag bei Elsevier
Format:	PDF
Veröffentl.:	21.01.2020
ISBN/EAN:	9783658291495
Sprache:	englisch

In den Warenkorb

Dieses eBook enthält ein Wasserzeichen.

Beschreibungen

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.

Autorenportrait

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

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.<div><br></div><div><b>Contents</b></div><div><ul><li>Theoretical basics for solving multiobjective mixed-integer convex optimization problems</li><li>An algorithm for solving this class of optimization problems</li><li>Test instances and numerical results</li></ul></div><div><b>Target Groups</b></div><div><ul><li>Students and Lecturers in the field of mathematics and economics </li><li>Practitioners in the field of multiobjective mixed-integer convex optimization problems</li></ul></div><div><b>The Author</b></div><div>Stefan Rocktäschel works as scientific assistant at the Institute forMathematics of Technische Universität Ilmenau, Germany.</div><div><br></div><div><br></div><div><br></div><div><br></div><div><br></div><div><br></div>