In this paper a network comprising alternative branching nodes with probabilistic outcomes is considered. In other words, network nodes are probabilistic with exclusive-or receiver and exclusive-or emitter. First, an analytical approach is proposed to simplify the structure of network. Then, it is assumed that the duration of activities is positive trapezoidal fuzzy number (TFN). This paper com...

multistage stochastic programming is a key technology for making decisions over time in an uncertain environment. one of the promising areas in which this technology is implementable, is medium term planning of electricity production and trading where decision makers are typically faced with uncertain parameters (such as future demands and market prices) that can be described by stochastic proc...

a memory control for t-s fuzzy discrete-time systems with sto- chastic input delay is proposed in this paper. dierent from the common assumptions on the time delay in the existing literatures, it is assumed in this paper that the delays vary randomly and satisfy some probabilistic dis- tribution. a new state space model of the discrete-time t-s fuzzy system is derived by introducing some stocha...

the hub location decision is a long term investment and any changes in it take considerable time and money. in real situations, some parameters are uncertain hence, deterministic models cannot be more efficient. the ability of two-stage stochastic programming is to make a long-term decision by considering effects of it in short term decisions simultaneously. in the two-stage stochastic programm...

  Data envelopment analysis (DEA) is a nonparametric approach to evaluate theefficiency of decision making units (DMU) using mathematical programmingtechniques. Almost, all of the previous researches in stochastic DEA have been usedthe stochastic data when the inputs and outputs are normally distributed. But, thisassumption may not be true in practice. Therefore, using a normal distribution wi...

We give multi-stage stochastic programming formulations for lot-sizing problems where costs, demands and order lead times follow a general discrete-time stochastic process with finite support. We characterize the properties of an optimal solution and give a dynamic programming algorithm, polynomial in input size, when orders do not cross in time.