To read the full-text of this research, you can request a copy directly from the author.
An algorithm is described for analyzing a target function f(x//1,. . . . ,x//n) in a nonlinear programming problem in order to find the number of local minima. For analysis, subsets of convexity of the function f(x//1,. . . . ,x//n) are singled out on the set of specification X.