This article developed an approached model of congestion, based on relaxed combination of inputs, in stochastic data envelopment analysis (SDEA) with chance constrained programming approaches. Classic data envelopment analysis models with deterministic data have been used by many authors to identify congestion and estimate its levels; however, data envelopment analysis with stochastic data were...

determination a sequence of extracting ore is one of the most important problems in mine annual production scheduling. production scheduling affects mining performance especially in a poly-metallic open pit mine with considering the imposed operational and physical constraints mandated by high levels of reliability in relation to the obtained actual results. one of the important operational con...

Classical automated test assembly (ATA) methods assume fixed and known coefficients for the constraints objective function. This hypothesis is not true estimates of item response theory parameters, which are crucial elements in classical models. To account uncertainty ATA, we propose a chance-constrained version maximin ATA model, allows maximizing α-quantile sampling distribution information f...

When designing or upgrading a communication network, operators are faced with a major issue, as uncertainty on communication demands makes it difficult to correctly provision the network capacity. When a probability on traffic matrices is given, finding the cheapest capacity allocation that guarantees, within a prescribed level of confidence, that each arc can support the traffic demands peaks ...

Consideration of quality implicitly introduces the need to adjust inputs in order to obtain desired output. Output evaluation must consider quality as well as cost. Real decisions may involve other objectives as well. Production problems often involve a dynamic situation where the relationship between cost and quality must be experimentally developed. The proposed method is to use regression as...

In this paper, we study the linear fractional transportation problem with uncertain arameters. After recalling some definitions, concepts and theorems in uncertainty theory we present three approaches for solving this problem. First we consider the expected value of the objective function together with the expectation of satisfying constraints. Optimizing the expected value of the objective fun...

In this paper, we consider an n-player non-cooperative game where the random payoff function of each player is defined by its expected value and her strategy set a joint chance constraint. The constraint vectors are independent. We case when probability distribution vector belongs to subset elliptical distributions as well it finite mixture from subset. propose convex reformulation derive bound...