Abstract:
We consider the two-stage stochastic linear programming problem with quantile criterion in case when the vector of random parameters has a discrete distribution with a finite number of realizations. Based on the confidence method and duality theorems, we construct a decompositional algorithm for finding guaranteeing solutions.
Keywords:stochastic programming, two-stage problems, linear programming, quantile criterion, decompositional algorithms.
Presented by the member of Editorial Board:A. I. Kibzun