Title: Monte Carlo Sampling in Stochastic Programming: Assessing Solution Quality and Sequential Sampling Speaker: Güzin Bayraksan, University of Arizona and David Morton, Stanford University Date/Time: Thursday, January 14th, 2010 from 10:30-11:30am Location: CSRI Building, Room 90 (Sandia NM) videoconferenced to 915/W133 (Sandia CA) Brief Abstract: We first present a simple, easily implemented procedure that uses Monte Carlo sampling to form a point and interval estimator on the optimality gap of a candidate solution to a stochastic program. We then discuss variations aimed to reduce computational effort and variance. We also provide a framework that allows the use these optimality gap estimators in an algorithmic way by providing rules to sequentially increase the sample sizes and to terminate. This scheme can be used as a stand-alone sequential sampling procedure, or it can be used in conjunction with a variety of sampling-based algorithms to obtain a solution to a stochastic program with a priori control on the quality of that solution. Bios: CSRI POC: Jean Paul Watson, (505) 845-8887 |