نتایج جستجو برای: chance constrained programming

تعداد نتایج: 432357  

Journal: :iranian journal of fuzzy systems 2005
saeed ramezanzadeh azizollah memariani saber saati

in this paper, we deal with fuzzy random variables for inputs andoutputs in data envelopment analysis (dea). these variables are considered as fuzzyrandom flat lr numbers with known distribution. the problem is to find a method forconverting the imprecise chance-constrained dea model into a crisp one. this can bedone by first, defuzzification of imprecise probability by constructing a suitablem...

2013
Hiroki Yanagisawa Takayuki Osogami

The Chance-Constrained Stochastic Programming (CCSP) is one of the models for decision making under uncertainty. In this paper, we consider the special case of the CCSP in which only the righthand side vector is random with a discrete distribution having a finite support. The unit commitment problem is one of the applications of the special case of the CCSP. Existing methods for exactly solving...

2014
Y. Zare Mehrjerdi Yahia Zare Mehrjerdi

There are many cases that a nonlinear fractional programming, generated as a result of studying fractional stochastic programming, must be solved. Sometimes an approximate solution may be sufficient enough to start a new process of calculations. To this end, this author introduces a new linear approximation technique for solving a fractional chance constrained programming (CCP) problem. After i...

2013
Mousumi Kumar Bijay Baran Pal

This paper presents a fuzzy goal programming (FGP) procedure for solving multilevel programming problems (MLPPs) having chance constraints in large hierarchical decision organizations. In the proposed approach, first the chance constraints of a problem are converted into their respective deterministic equivalent in the decision making context. Then, the objective functions of decision makers (D...

Journal: :European Journal of Operational Research 2012
Arkadi Nemirovski

A natural way to handle optimization problem with data affected by stochastic uncertainty is to pass to a chance constrained version of the problem, where candidate solutions should satisfy the randomly perturbed constraints with probability at least 1− . While being attractive from modeling viewpoint, chance constrained problems “as they are” are, in general, computationally intractable. In th...

J. Nematian

HLP (hub location problem) tries to find locations of hub facilities and assignment of nodes to extended facilities. Hubs are facilities to collect, arrange, and distribute commodities in telecommunication networks, cargo delivery systems, etc. Hubs are very crucial and their inaccessibility impresses on network whole levels. In this paper, first, total reliability of the network is defined bas...

2015
Ma Huiru

In practice, due to the lack of information, imprecise variables which come from experts’ empirical data usually appear. In order to deal with these imprecise variables, uncertainty theory is proposed and has been proved to be an efficient method. This paper introduces uncertainty theory into travelling salesman problem (TSP), in which the link travel times are assumed to be uncertain variables...

Journal: :Math. Program. 2016
Xiao Liu Simge Küçükyavuz James R. Luedtke

We study a class of chance-constrained two-stage stochastic optimization problems where second-stage feasible recourse decisions incur additional cost. In addition, we propose a new model, where “recovery” decisions are made for the infeasible scenarios to obtain feasible solutions to a relaxed second-stage problem. We develop decomposition algorithms with specialized optimality and feasibility...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید