We consider optimization problems with a small implicitly denned feasible region, and with an objective function corrupted by irregularities, e.g. small noise added to the function values. Known mathematical programming methods with high convergence rate can not, lie applied to such problems. A hybrid technique is developed combining random search for the feasible region of a considered problem, and evolutionary search for the minimum over the found region. The solution results of two test problems and of a difficult real world problem are presented.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.