Computational algorithms based on random search for solving global optimization problems

Abstract

Computational algorithms based on random search approach for solving unconstrained and con-strained global optimization problems have been proposed and tested on a number of test problems taken from literature. The results show that the proposed algorithms can be used to solve moderately sized unconstrained, inequality constrained and a class of equality constrained global optimization problems.