Abstract:
A method is suggested for solution of optimization problems with an integral performance criterion. Identification of sublntervals where the criterion is sensitive to the parameters to be optimized permits decompositn the original problem into a sequence of subproblems with a lower dimension of the search space. In a number of cases this eliminates ravines of the criterial surface and accelerates the search for optimal solutions. The effectiveness of the approach is confirmed in a test problem.