Advertisement

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

  • Stefan Rocktäschel
Book
  • 288 Downloads

Part of the BestMasters book series (BEST)

Table of contents

  1. Front Matter
    Pages I-VIII
  2. Stefan Rocktäschel
    Pages 1-3
  3. Stefan Rocktäschel
    Pages 5-15
  4. Stefan Rocktäschel
    Pages 17-39
  5. Stefan Rocktäschel
    Pages 41-49
  6. Stefan Rocktäschel
    Pages 51-59
  7. Stefan Rocktäschel
    Pages 61-62
  8. Stefan Rocktäschel
    Pages 63-63
  9. Back Matter
    Pages 65-70

About this book

Introduction

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.






Keywords

Multiobjective Programming Mixed Integer Programming Convex Nonlinear Optimization Branch-and-Bound Algorithm

Authors and affiliations

  • Stefan Rocktäschel
    • 1
  1. 1.IlmenauGermany

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-658-29149-5
  • Copyright Information Springer Fachmedien Wiesbaden GmbH, part of Springer Nature 2020
  • Publisher Name Springer Spektrum, Wiesbaden
  • eBook Packages Mathematics and Statistics
  • Print ISBN 978-3-658-29148-8
  • Online ISBN 978-3-658-29149-5
  • Series Print ISSN 2625-3577
  • Series Online ISSN 2625-3615
  • Buy this book on publisher's site