ABSTRACT: 

Multistage stochastic programming problems are an important class of optimisation problems, especially in energy planning and scheduling. These problems and their solution methods have been of particular interest to researchers in stochastic programming recently. Because of the large scenario trees that these problems induce, current solution methods require random sampling of the tree in order to build a candidate policy. Candidate policies are then evaluated using Monte Carlo simulation.  Under certain sampling assumptions, theoretical convergence is obtained almost surely. In practice, the convergence of a given policy requires a statistical test and is only guaranteed at a given level of confidence.    
In this talk, I will present a deterministic algorithm to solve these problems. The main feature of this algorithm is a deterministic path sampling scheme during the forward pass phase of the algorithm which is guaranteed to reduce the bound gap at all the nodes visited. Because policy simulation is no longer required, there is an improvement in performance over traditional methods for problems in which a high level of confidence is sought.

BIO: Regan Baucke is a PhD Student at the University of Auckland working under the supervisors Golbon Zakeri and Anthony Downward.  His work focuses on multistage stochastic programming and risk aversion. He is a member of the EPOC research group at the University of Auckland, which focuses on mathematical modeling and optimisation with the view of analyzing and improving the New Zealand electricity market.