A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization (BestMasters) - Softcover

Buch 87 von 91: BestMasters

Rocktäschel, Stefan

 
9783658291488: A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization (BestMasters)

Inhaltsangabe

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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Über die Autorin bzw. den Autor

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

Von der hinteren Coverseite

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.






„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.