In this paper, we study the dynamical properties of the population based incremental learning (PBIL) algorithm when it uses truncation, proportional, and Boltzmann selection schemas. The results show that if the population size tends to infinity, with any learning rate, the local optima of the function to be optimized are asymptotically stable fixed points of the PBIL.