Stefan Rocktäschel

A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization (eBook, PDF)

• Format: PDF

Produktbeschreibung

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 forMathematics of Technische Universität Ilmenau, Germany.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Springer Fachmedien Wiesbaden
• Seitenzahl: 70
• Erscheinungstermin: 21. Januar 2020
• Englisch
• ISBN-13: 9783658291495
• Artikelnr.: 58557067

Autorenporträt

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

Inhaltsangabe

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