Package com.complexible.common.collect

Class NonDominatedSolutions<T extends Iterable<? extends Number>>

java.lang.Object
com.complexible.common.collect.NonDominatedSolutions<T>
Type Parameters:
T - The type of elements in the collection. They combine both the solution x and numeric objective function values fi(x) which can be iterated
All Implemented Interfaces:
Iterable<T>, Collection<T>
public class NonDominatedSolutions<T extends Iterable<? extends Number>> extends Object implements Collection<T>
A collection which keeps all non-dominated solutions in terms of a (multi-objective) optimization problem. Let X be the search space of an optimization problem, we call x \in X a solution of the problem. Furthermore, let F = [f1,...,fn] be the objective functions of an optimization problem. The objective function values of a solution x are given as [f1(x), ... , fn(x)] A solution x dominates a solution x', iff fi(x) invalid input: '<' fi(x') for at least one fi \in F and at the same time there does not exist a fj \in F such that fj(x') invalid input: '<' fj(x). For every solution x in this collection, it holds that there does not exist another solution x' such that x' dominates x. Note: The term solution in this context does not refer to a SPARQL solution (mapping).
Since:
9.3
Author:
Lars Heling