On the worst‐case optimal multi‐objective global optimization

Multi‐objective optimization problem with Lipshitz objective functions is considered. It is shown that the worst‐case optimal passive algorithm can be reduced to the computation of centers of balls producing the optimal cover of a feasible region, where the balls are of equal minimum radius. It is also shown, that in the worst‐case, adaptivity does not improve the guaranteed accuracy achievable by the passive algorithm.