Derive a procedure to perform a univariate search along distance S of a curved path 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...

Derive a procedure to perform a univariate search along distance S of a curved path 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 path 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.