Numbers S and L are the smaller or larger of two numbers. What number, ε, when added to S and subtracted from L minimizes the product? Derive a procedure to perform a univariate search along distance...

Numbers S and L are the smaller or larger of two numbers. What number, ε, when added to S and subtracted from L minimizes the product?

Derive a procedure to perform a univariate search along distance S of a curved line in x–y–z space. The DV is distance S. The y and z positions of the line can be described as functions of the x-position, y = f(x), and z = g(x). The value of the OF along the line is a function of position OF = v(x,y,z). The optimizer is not the issue. Show how can you find the OF value, from the trial solution, S, value. Choose nonlinear functions for f, g, and v, and implement your search for the optimum.