Text this: Comparing ROSE and the NBI algorithm combined with a SF with same , applied to the problem of the bi-objective optimization of an I-Beam using different initial values of <i>x</i>_<i>o</i> that correspond to starting at different points in the objective space: (a) Run 1, <i>x</i>_<i>o</i> = <i>[</i>45,35,3.8,1.2<i>]</i> (b) <i>x</i>_<i>o</i> = <i>[</i>30,20,1.5,4<i>]</i> (c)<i>x</i>_<i>o</i> = <i>[</i>45,35,2,4<i>]</i> (d) Comparing the mean number of iterations per significant Pareto point for both algorithms across runs from different initial guesses.