Single Commodity Stochastic Network Design Under Probabilistic Constraint with Discrete Random Variables

Single commodity networks are considered, where demands at the nodes are random. The problem is to find minimum cost optimal built in capacities at the nodes and arcs subject to the constraint that all demands should be met on a prescribed probability level (reliability constraint) and some deterministic constraints should be satisfied. The reliability constraint is formulated in terms of the Gale–Hoffman feasibility inequalities, but their number is reduced by elimination technique. The concept of a p-efficient point is used in a smart way to convert and then relax the problem into an LP. The p-efficient points are simultaneously generated with the solution of the LP. The joint distribution of the demands is used to obtain the p-efficient points for all stochastic inequalities that were not eliminated and the solution of a multiple choice knapsack problem is used to generate p-efficient points. The model can be applied to planning in interconnected power systems, flood control networks, design of shelter...

[1]  D. Walkup,et al.  Association of Random Variables, with Applications , 1967 .

[2]  András Prékopa,et al.  The discrete moment problem and linear programming , 1990, Discret. Appl. Math..

[3]  András Prékopa,et al.  Scheduling of Power Generation , 2014 .

[4]  Tamás Szántai,et al.  Combinatorial results on the fitting problems of the multivariate gamma distribution introduced by Prékopa and Szántai , 2012, Ann. Oper. Res..

[5]  James R. Luedtke,et al.  A Sample Approximation Approach for Optimization with Probabilistic Constraints , 2008, SIAM J. Optim..

[6]  András Prékopa,et al.  ON THE PROBABILITY DISTRIBUTION OF THE OPTIMUM OF A RANDOM LINEAR PROGRAM , 1966 .

[7]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[8]  A. Prékopa,et al.  Programming Under Probabilistic Constraint with Discrete Random Variable , 1998 .

[9]  David Pisinger.  A minimal algorithm for the Multiple-choice Knapsack Problem , 1995 .

[10]  A. Prékopa.  On the relationship between probabilistic constrained , disjunctive and multiobjective programming , 2006 .

[11]  P. Gordan.  Ueber die Auflösung linearer Gleichungen mit reellen Coefficienten , 1873 .

[12]  Tamás Szántai,et al.  A new multivariate gamma distribution and its fitting to empirical streamflow data , 1978 .

[13]  Béla Vizvári.  The integer programming background of a stochastic integer programming algorithm of dentcheva‐prékopa‐ruszczyński , 2002, Optim. Methods Softw..

[14]  András Prékopa,et al.  Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution , 1990, ZOR Methods Model. Oper. Res..

[15]  Alan J. Hoffman,et al.  SOME RECENT APPLICATIONS OF THE THEORY OF LINEAR INEQUALITIES TO EXTREMAL COMBINATORIAL ANALYSIS , 2003 .

[16]  Endre Boros,et al.  On the Existence of a Feasible Flow in a Stochastic Transportation Network , 1991, Oper. Res..

[17]  Darinka Dentcheva,et al.  Bounds for probabilistic integer programming problems , 2002, Discret. Appl. Math..

[18]  A. Prékopa.  On logarithmic concave measures and functions , 1973 .

[19]  Maria Gabriela Martinez,et al.  Regularization methods for optimization problems with probabilistic constraints , 2013, Math. Program..

[20]  Teodor Gabriel Crainic,et al.  Single-Commodity Network Design with Stochastic Demand and Multiple Sources and Sinks , 2011, INFOR Inf. Syst. Oper. Res..

[21]  András Prékopa,et al.  NETWORK PLANNING USING TWO-STAGE PROGRAMMING UNDER UNCERTAINTY , 1980 .

[22]  Teodor Gabriel Crainic,et al.  Single source single-commodity stochastic network design , 2011, Computational Management Science.

[23]  A. Charnes.  Optimality and Degeneracy in Linear Programming , 1952 .

[24]  E. Balas.  DISJUNCTIVE PROGRAMMING: CUTTING PLANES FROM LOGICAL CONDITIONS , 1975 .

[25]  George L. Nemhauser,et al.  An integer programming approach for linear programs with probabilistic constraints , 2010, Math. Program..

[26]  A. Charnes,et al.  Cost Horizons and Certainty Equivalents: An Approach to Stochastic Programming of Heating Oil , 1958 .

[27]  Csaba I. Fábián,et al.  On a dual method for a specially structured linear programming problem with application to stochastic programming , 2002, Optim. Methods Softw..

[28]  R. Jagannathan,et al.  Chance-Constrained Programming with Joint Constraints , 1974, Oper. Res..

[29]  András Prékopa.  Multivariate value at risk and related topics , 2012, Ann. Oper. Res..

[30]  A. W. Tucker,et al.  Duality Theory of Linear Programs: A Constructive Approach with Applications , 1969 .

[31]  Kaan Ozbay,et al.  Impact of Probabilistic Road Capacity Constraints on the Spatial Distribution of Hurricane Evacuation Shelter Capacities , 2007 .

[32]  Roger J.-B. Wets,et al.  The facets of the polyhedral set determined by the Gale—Hoffman inequalities , 1993, Math. Program..

[33]  Darinka Dentcheva,et al.  Concavity and efficient points of discrete distributions in probabilistic programming , 2000, Math. Program..

[34]  Vladimir Gurvich,et al.  An Intersection Inequality for Discrete Distributions and Related Generation Problems , 2003, ICALP.

[35]  A. Prékopa.  Logarithmic concave measures with applications to stochastic programming , 1971 .

[36]  Erich Stiemke.  Über positive Lösungen homogener linearer Gleichungen , 1915 .

[37]  Nilay Noyan,et al.  Mathematical programming approaches for generating p-efficient points , 2010, Eur. J. Oper. Res..