A Branch-And-Bound Algorithm for Multiobjective Mixed-Integer Convex Optimization

ISBN-13: 9783658291488 / Angielski / Miękka / 2020 / 70 str.

Stefan Rocktaschel

Spis treści

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

O autorze

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

Blurb

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.

Contents

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

Target Groups

• Students and Lecturers in the field of mathematics and economics 
• Practitioners in the field of multiobjective mixed-integer convex optimization problems

The Author

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