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

Type Book

Rate 0.0 /5

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 …

Details

Files

Reviews

Download

Title Statements

Full title :A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization / by Stefan Rocktäschel.

Summary

Stefan Rocktä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 Rocktäschel works as scientific assistant at the Institute for Mathematics of Technische Universität Ilmenau, Germany.

Edition Statements

Publication Date:2020 :
Edition:1st ed. 2020

Publication Statements

Publisher(s):Imprint: Springer Spektrum, Springer Fachmedien Wiesbaden
Place of Publication:Wiesbaden
Language:eng
Publication Date:2020 :

The Physical Object

Description:1 online resource (VIII, 70 pages 15 illustrations) : : online resource

Edition Identifiers

ISBN:9783658291495, 3658291494, 9783658291488, 3658291486
oclc:on1140363444
LC Classification:T57-57.97
Dewey Decimal:519

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