  


Datadriven Chance Constrained Stochastic Program
Ruiwei Jiang (rwjiangufl.edu) Abstract: Chance constrained programming is an effective and convenient approach to control risk in decision making under uncertainty. However, due to unknown probability distributions of random parameters, the solution obtained from a chance constrained optimization problem can be biased. In practice, instead of knowing the true distribution of a random parameter, only a series of historical data, which can be considered as samples taken from the true (while ambiguous) distribution, can be observed and stored. In this paper, we develop exact approaches to solve stochastic programs with Datadriven Chance Constraints (DCCs). For a given historical data set, we construct two types of confidence sets for the ambiguous distribution through nonparametric statistical estimation of its moments and density functions. We then formulate DCCs from the perspective of robust feasibility, by allowing the ambiguous distribution to run adversely within its confidence set. By deriving equivalent reformulations, we show that stochastic programs with DCCs under both momentbased and density based confidence sets can be solved effectively. In addition, we derive the relationship between the conservatism of DCCs and the sample size of historical data, which shows quantitatively what we call the value of data. Keywords: stochastic optimization; chance constraints; semiinfinite programming; SLemma Category 1: Stochastic Programming Category 2: Infinite Dimensional Optimization (Semiinfinite Programming ) Category 3: Linear, Cone and Semidefinite Programming (Semidefinite Programming ) Citation: Download: [PDF] Entry Submitted: 07/05/2012 Modify/Update this entry  
Visitors  Authors  More about us  Links  
Subscribe, Unsubscribe Digest Archive Search, Browse the Repository

Submit Update Policies 
Coordinator's Board Classification Scheme Credits Give us feedback 
Optimization Journals, Sites, Societies  