## Multistage Stochastic Decomposition and its Applications

dc.contributor.advisor | Sen, Suvrajeet | en_US |

dc.contributor.advisor | Bayraksan, Guzin | en_US |

dc.contributor.author | Zhou, Zhihong | |

dc.creator | Zhou, Zhihong | en_US |

dc.date.accessioned | 2012-05-09T22:10:47Z | |

dc.date.available | 2012-05-09T22:10:47Z | |

dc.date.issued | 2012 | |

dc.identifier.uri | http://hdl.handle.net/10150/222892 | |

dc.description.abstract | In this dissertation, we focus on developing sampling-based algorithms for solving stochastic linear programs. The work covers both two stage and multistage versions of stochastic linear programs. In particular, we first study the two stage stochastic decomposition (SD) algorithm and present some extensions associated with SD. Specifically, we study two issues: a) are there conditions under which the regularized version of SD generates a unique solution? and b) in cases where a user is willing to sacrifice optimality, is there a way to modify the SD algorithm so that a user can trade-off solution times with solution quality? Moreover, we present our preliminary approach to address these questions. Secondly, we investigate the multistage stochastic linear programs and propose a new approach to solving multistage stochastic decision models in the presence of constraints. The motivation for proposing the multistage stochastic decomposition algorithm is to handle large scale multistage stochastic linear programs. In our setting, the deterministic equivalent problems of the multistage stochastic linear program are too large to be solved exactly. Therefore, we seek an asymptotically optimum solution by simulating the SD algorithmic process, which was originally designed for two-stage stochastic linear programs (SLPs). More importantly, when SD is implemented in a time-staged manner, the algorithm begins to take the flavor of a simulation leading to what we refer to as optimization simulation. As for multistage stochastic decomposition, there are a couple of advantages that deserve mention. One of the benefits is that it can work directly with sample paths, and this feature makes the new algorithm much easier to be integrated within a simulation. Moreover, compared with other sampling-based algorithms for multistage stochastic programming, we also overcome certain limitations, such as a stage-wise independence assumption. | |

dc.language.iso | en | en_US |

dc.publisher | The University of Arizona. | en_US |

dc.rights | Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author. | en_US |

dc.subject | Optimization Simulation | en_US |

dc.subject | Stage-wise Independence | en_US |

dc.subject | Stochastic Decomposition | en_US |

dc.subject | Stochastic Dual Dynamic Programming | en_US |

dc.subject | Systems & Industrial Engineering | en_US |

dc.subject | Multistage Stochastic Decomposition | en_US |

dc.subject | Multistage Stochastic Program | en_US |

dc.title | Multistage Stochastic Decomposition and its Applications | en_US |

dc.type | text | en_US |

dc.type | Electronic Dissertation | en_US |

thesis.degree.grantor | University of Arizona | en_US |

thesis.degree.level | doctoral | en_US |

dc.contributor.committeemember | Son, Young Jun | en_US |

dc.contributor.committeemember | Lin, Wei Hua | en_US |

dc.contributor.committeemember | Sen, Suvrajeet | en_US |

dc.contributor.committeemember | Bayraksan, Guzin | en_US |

thesis.degree.discipline | Graduate College | en_US |

thesis.degree.discipline | Systems & Industrial Engineering | en_US |

thesis.degree.name | Ph.D. | en_US |

refterms.dateFOA | 2018-06-12T12:46:59Z | |

html.description.abstract | In this dissertation, we focus on developing sampling-based algorithms for solving stochastic linear programs. The work covers both two stage and multistage versions of stochastic linear programs. In particular, we first study the two stage stochastic decomposition (SD) algorithm and present some extensions associated with SD. Specifically, we study two issues: a) are there conditions under which the regularized version of SD generates a unique solution? and b) in cases where a user is willing to sacrifice optimality, is there a way to modify the SD algorithm so that a user can trade-off solution times with solution quality? Moreover, we present our preliminary approach to address these questions. Secondly, we investigate the multistage stochastic linear programs and propose a new approach to solving multistage stochastic decision models in the presence of constraints. The motivation for proposing the multistage stochastic decomposition algorithm is to handle large scale multistage stochastic linear programs. In our setting, the deterministic equivalent problems of the multistage stochastic linear program are too large to be solved exactly. Therefore, we seek an asymptotically optimum solution by simulating the SD algorithmic process, which was originally designed for two-stage stochastic linear programs (SLPs). More importantly, when SD is implemented in a time-staged manner, the algorithm begins to take the flavor of a simulation leading to what we refer to as optimization simulation. As for multistage stochastic decomposition, there are a couple of advantages that deserve mention. One of the benefits is that it can work directly with sample paths, and this feature makes the new algorithm much easier to be integrated within a simulation. Moreover, compared with other sampling-based algorithms for multistage stochastic programming, we also overcome certain limitations, such as a stage-wise independence assumption. |