Mapping the convergence of genetic algorithms.
Multistage stochastic optimization requires the definition and the generation of a discrete stochastic tree that represents the evolution of the uncertain parameters in time and space. The dimension of the tree is the result of a trade-off between the adaptability to the original probability distribution and the computational tractability. Moreover, the discrete approximation of a continuous random variable is not unique. The concept of the best discrete approximation has been widely explored and...
The paper deals with a special case of multistage stochastic programming problems. In particular, the paper deals with multistage stochastic programs in which a random element follows an autoregressive sequence and constraint sets correspond to the individual probability constraints. The aim is to investigate a stability (considered with respect to a probability measures space) and empirical estimates. To achieve new results the Wasserstein metric determined by norm and results of multiobjective...