Pareto Dominance Check

Problem

In a minimization setting, point a dominates point b when every objective of a is at most that of b and at least one is strictly smaller.

Given the two objective vectors, return True when a dominates b.

Hint

Weak inequality everywhere plus strict inequality somewhere.

case 1

in: [[1,2],[2,3]]

expected: true

case 2

in: [[1,1],[1,2]]

expected: true

case 3

in: [[2,3],[1,2]]

expected: false

Starter codePython

def pareto_dominance_check(a, b):
    # Your code here
    pass

3 test cases · run your code against them in the editor