نتایج جستجو برای: chance con strained programming
تعداد نتایج: 484532 فیلتر نتایج به سال:
By fuzzy random programming, we mean the optimization theory dealing with fuzzy random decision problems. This paper presents a new concept of chance of fuzzy random events and then constructs a general framework of fuzzy random chance-constrained programming (CCP). We also design a spectrum of fuzzy random simulations for computing uncertain functions arising in the area of fuzzy random progra...
This study presents a multimodal hub location problem which has the capability to split commodities by limited-capacity hubs and transportation systems, based on the assumption that demands are stochastic for multi-commodity network flows. In the real world cases, demands are random over the planning horizon and those which are partially fulfilled, are lost. Thus, the present study handles dema...
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید