Advertisement

Extension for multicriteria problems

  • Daniel Scholz
Chapter
Part of the Springer Optimization and Its Applications book series (SOIA, volume 63)

Abstract

In this chapter, our goal is to generalize the geometric branch-and-bound algorithm to multicriteria optimization problems. To this end, after a short introduction in Section 4.1 we summarize the fundamental definitions and results about multicriteria optimization in Section 4.2. We remark that most of the results in the following sections can also be found in Scholz (2010). However, we introduce the concept of multicriteria bounding operations in Section 4.3 which has not been used therein. Next, in Section 4.4 we prove the convergence of the proposed algorithm as well as properties of the output set. The method is demonstrated on bicriteria facility location problems in Section 4.5 and some numerical results are given in Section 4.6.

Keywords

Location Problem Pareto Optimal Solution Demand Point Multicriteria Optimization Single Objective Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  1. 1.Institute for Numerical and Applied MathematicsGeorg-August-University GöttingenGöttingenGermany

Personalised recommendations