Check if a vector dominates another (dominates
or does_dominate
)
or is dominated by another (is_dominated
). There are corresponding infix
operators dominates
and is_dominated
.
dominates(x, y) does_dominate(x, y) is_dominated(x, y) x %dominates% y x %is_dominated% y
x | [ |
---|---|
y | [ |
Single logical value.
Given two vectors \(x,y \in R^m\) we say that \(x\) dominates \(y\), denoted as \(x \preceq y\) if and only if $$ x_i \leq y_i \, \forall i \in \{1, \ldots, m\} $$ and $$ \exists j \in \{1, \ldots, m\}: x_i < y_i. $$ Informally, \(x\) dominates \(y\) if \(x\) is no worse than \(y\) in all components and \(x\) is strictly better than \(y\) in at least one component. Note that this definition focuses on minimization of all objectives. This is no restriction since the maximization of some function is equivalent to the minimization of its negative counterpart.
Other Pareto-dominance checks:
dominated()
,
set_dominates()
,
which_dominated()
Other multi-objective tools:
dominated()
,
set_dominates()
,
which_dominated()
#> [1] TRUE#> [1] FALSE#> [1] FALSE#> [1] TRUE#> [1] TRUE#> [1] FALSE