Monte Carlo Optimization
This chapter is the equivalent for optimization problems of what Chapter 3 is for integration problems. We distinguish between two separate uses of computer-generated random variables to solve optimization problems. The first use, as seen in Section 5.3, is to produce stochastic search techniques to reach the maximum (or minimum) of a function, devising random exploration techniques on the surface of this function that avoid being trapped in local maxima (or minima) and are sufficiently attracted by the global maximum (or minimum). The second use, described in Section 5.4, is closer to Chapter 3 in that simulation is used to approximate the function to be optimized.
Unable to display preview. Download preview PDF.