Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex OptimizationTheoretical Basics

A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization: Theoretical... [In this chapter, we introduce the basic concepts of multiobjective optimization. We introduce basic definitions and derive a concept of optimality for multiobjective optimization problems. Based on this, we formulate the central optimization problem that we study throughout this book and introduce a relaxed optimization problem that we use in order to solve the central optimization problem.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex OptimizationTheoretical Basics

Download PDF
10 pages

Loading next page...
 
/lp/springer-journals/a-branch-and-bound-algorithm-for-multiobjective-mixed-integer-convex-m82nCU0HZ8
Publisher
Springer Fachmedien Wiesbaden
Copyright
© Springer Fachmedien Wiesbaden GmbH, part of Springer Nature 2020
ISBN
978-3-658-29148-8
Pages
5 –15
DOI
10.1007/978-3-658-29149-5_2
Publisher site
See Chapter on Publisher Site

Abstract

[In this chapter, we introduce the basic concepts of multiobjective optimization. We introduce basic definitions and derive a concept of optimality for multiobjective optimization problems. Based on this, we formulate the central optimization problem that we study throughout this book and introduce a relaxed optimization problem that we use in order to solve the central optimization problem.]

Published: Jan 22, 2020

There are no references for this article.