A Branch-and-bound Algorithm for Multiobjective Mixed-integer Convex Optimization - Brossura

Rocktäschel, Stefan

 
9783658291488: A Branch-and-bound Algorithm for Multiobjective Mixed-integer Convex Optimization

Sinossi

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.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Informazioni sull?autore

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

Dalla quarta di copertina

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.






Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.