What I want you to do is……….

How can you test the under approximation for pareto objective optimization. So how can you somehow
design an experiment the test be performance of under approximation. This was just an approach that I
suppose is pretty good to show it.

So what I told you, when you come up with a different idea is also fine.

So I want you to find out how much faster is to use the under approximation compared to exact value
calculation.

If I choose some some other method not NSGA then is it ok?

Well if you choose under approximation then it is ok but actually you don’t have to do something
difficult like NSGA or this one is probably also difficult to integrate it.

To integrate it, to integrate the under approximation in to this method. So the easiest way to check if
under approximation approach is faster is to just in simple non dominated filtering and only count how
many times the under approximation seems and how many time exact value seems.

So here objective function f1 and objective function f2. So here when you do non dominated check, the
pareto optimal points are this one, this one, this one……(here professor talks about random points
diagram)

How much time does it takes to find out these values. So you only have given these points and now
these 4, 5, or 6 points in the end.

Means not these many points?

Only this in non dominated front only the pareto optimal points because in this example there are no
other points right.

So may be you can create some different points may be pareto optimal

I have done it with 100 points, I will make it for 10000 or 20000 points

You can first do it with 10 or 20 to check out if your approach works.

I will make pareto front in terms of line

Does not have to be graphical only some points.

In this step some points are saved in r1 and r2. So in the end it stands r1* r2*. I think it works with
matlab but don’t know becoz its not really a programming language.