Ranking Pareto Optimal Solutions

Question!

I have to build the 1st, 2nd and nth pareto front from the given random data. Right now I have a numpy array

[[100, 1], [50, 50], [1, 100], [101, 2], [51, 51], [2,101]]

any element1, element2 in nth pareto front, element3 in n+1 th pareto front should satisfy the following constraints

  1. element1[0] <= element2[0] and element1[1] >= element2[1] or element1[0] >= element2[0] and element1[1] <= element2[1]
  2. element[0] < element3[0] and element[1] < element3[1] where element is any item in nth pareto front.

Then the first pareto front = [[100, 1], [50, 50], [1, 100]]

second pareto front = [[101, 2], [51, 51], [2, 101]]

By : Dave1989


This video can help you solving your question :)
By: admin