Performing Pareto set membership tester for sets of points in K-dimensions

This fast function takes as input a sets of points, and determines which ones are Pareto optimal

isParetoSetMember returns the logical Pareto membership of a set of N points in K dimensions. It takes as input a N-by-N matrix and return a N-binary-array, denoting for each of the N points, whether it is Pareto (1) o not (0).

The concept of Pareto dominance considered herein is the standard multiobjective minimization problem.

The help containst three meaningful examples.

The c coding (mex file) allows effective performances. For this reason, this function may be a useful tool to be incorporated into multi-objective optimization algorithms implementation.