Pareto Dominance in Multi-Objective Optimization

The concept of Pareto dominance is of extreme importance in multi-objective optimization, especially where some or all of the objectives and constraints are mutually conflicting. In such a case, there is no Utopia pint, which is a single point that yields the "best" value for all objectives and constraints. Instead, the best solutions, often called a Pareto or non-dominated set, are a group of solutions such that selecting any one of them in place of another always sacrifices quality for at least one objective or constraint, while improving at least one other. Formally, the description of such Pareto optimality for generic optimization problems can be formulated as in the following equations.

Taking a closer, more formal look at the multi-objective optimization problem, let the following denote the set of all feasible solutions, which are those that do not violate constraints:

(52)

The problem can then be simplified to:

(53)

If there exists such that for all objective functions is optimal. This, for is expressed:

(54)

This indicates that is certainly a desirable solution. Unfortunately, this is a utopian situation that rarely exists, as it is unlikely that all has minimum values for at a common point . The question is left: What solution should be used? That is, how should an "optimal" solution be defined? First, consider the so-called ideal (utopian) solution. To define this solution, separately attainable minima must be found for all objective functions. Assuming there is one, let be the solution of the scalar optimization problem:

(55)

Here is called the individual minimum for the scalar problem . The vector is called ideal for a multi-objective optimization problem, and the points in , which determined this vector is the ideal solution.

It is usually not true that Equation 56 holds, although it would be useful, as the multi-objective problem would have been solved by considering a sequence for scalar problems. It is necessary to define a new form of optimality, which leads to the concept of Pareto Optimality. Introduced by V. Pareto in 1896, it is still the most important part of multi-objective optimization.

(56)

A point is said to be Pareto Optimal for the problem if there is no other vector such that for all

(57)

and, for at least one :

(58)

This definition is based on the intuitive conviction that the point is chosen as the optimal if no criterion can be improved without worsening at least one other criterion. Unfortunately, the Pareto optimum almost always gives not a single solution, but a set of solutions. Usually Pareto optimality is spoken of as being global or local depending on the neighborhood of the solutions , and in this case, almost all traditional algorithms can at best guarantee a local Pareto optimality. However, this MOGA-based system, which incorporates global Pareto filters, yields the global Pareto front.


Release 18.2 - © ANSYS, Inc. All rights reserved.