TY - JOUR TI - New results for optimization in stochastic networks DO - https://doi.org/doi:10.7282/T39P30D9 PY - 2012 AB - We are interested in single commodity stochastic network design problems under probabilistic constraint with discrete and continuous random variables. We use a stochastic programming model under probabilistic constraint (also called a chance-constrained model) to study these problems. The problem addressed in this research is how to find minimum cost optimal capacities at the nodes and/or arcs subject to the constraint that the demands should be met on a prescribed probability level (reliability constraint). In our first problem formulation, we formulate the reliability constraint in terms of the Gale-Hoffman feasibility inequalities. In latter formulations, we allow system to meet the demand at least $k$-out-of-$n$ and consecutive $k$-out-of-$n$ periods. The number of reliability constraints, in both cases, increases exponentially with the size of the nodes and therefore we identify the redundant constraints and reduce their number with elimination methods. Even with the reduced number of inequalities, it is not simple to solve probabilistic constrained stochastic network problems due to the large number of efficient points that satisfy the probabilistic condition. To overcome the size limitation of the problem, we develop a new theorem for efficient point generation in the case when the random variables are discrete, and we use hybrid cutting plane / supporting hyperplane algorithm in the case when the random variables are continuous. KW - Operations Research KW - Stochastic processes KW - Structural optimization LA - eng ER -