نتایج جستجو برای: Discrete Chance Constraint

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

B. Karimi, E. Nikzad M. Bashiri

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...

Journal: :journal of industrial engineering, international 2006
e jahangiri f ghassemi-tari

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...

Journal: :Journal of the Operations Research Society of Japan 1978

2010
SİMGE KÜÇÜKYAVUZ

The mixing set with a knapsack constraint arises in deterministic equivalent of chance-constrained programming problems with finite discrete distributions. We first consider the case that the chance-constrained program has equal probabilities for each scenario. We study the resulting mixing set with a cardinality constraint and propose facet-defining inequalities that subsume known explicit ine...

Journal: :Math. Program. 2012
Simge Küçükyavuz

The mixing set with a knapsack constraint arises in deterministic equivalent of chance-constrained programming problems with finite discrete distributions. We first consider the case that the chance-constrained program has equal probabilities for each scenario. We study the resulting mixing set with a cardinality constraint and propose facet-defining inequalities that subsume known explicit ine...

Journal: :International Journal of Energy Economics and Policy 2019

Journal: :international journal of industrial engineering and productional research- 0
yahia zare mehrjerdi department of industrial engineering, yazd university yazd iran

stochastic approach to vehicle routing problem: development and theories abstract in this article, a chance constrained (ccp) formulation of the vehicle routing problem (vrp) is proposed. the reality is that once we convert some special form of probabilistic constraint into their equivalent deterministic form then a nonlinear constraint generates. knowing that reliable computer software for lar...

Journal: :IEEE Control Systems Letters 2022

This paper studies the problem of distributionally robust model predictive control (MPC) using total variation distance ambiguity sets. For a discrete-time linear system with additive disturbances, we provide conditional value-at-risk reformulation MPC optimization that is in expected cost and chance constraints. The constraint over-approximated as simpler, tightened reduces computational burde...

2012
Zhaolin Hu L. Jeff Hong Liwei Zhang

We study joint chance constrained programs (JCCPs). JCCPs are often non-convex and non-smooth, and thus are generally challenging to solve. In this paper, we propose a logarithmsum-exponential smoothing technique to approximate a joint chance constraint by the difference of two smooth convex functions and use a sequential convex approximation algorithm, coupled with a Monte Carlo method, to sol...

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

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