Example 2

We have now two parameters and two functions to be optimized:

f1(x,y) = 0.125*(20 + x + y)**2

f2(x,y) = 100 + x*y

These distance functions are conflicting and hence they cannot be minimzed at the same time. It is possible however to find the pareto optimal solutions and then make a final selection.


example2.py


output
example2