Clemson University
Decision Making for Large-Scale Problems Under Uncertainty and Conflict
Abstract
dc:description.abstractLarge-scale decision-making problems appear in many areas including long-range forecasting such as energy generation forecasting. Many such problems are subject to conflicting objectives and uncertain data, and can be modeled as linear optimization problems. We study novel theoretical results and algorithms for large-scale linear decision problems under conflict and uncertainty. First, we propose a parametric Benders decomposition algorithm for solving large-scale linear optimization problems with multiple objectives or deterministically uncertain objectives. Second, we extend the parametric Benders decomposition to a multi-stage setting, developing a parametric stochastic dual dynamic programming algorithm, which enables decision-making when conflicts and uncertainty have planning impacts on multiple future stages. To improve the practicality of the algorithm, we explore accelerating the computation through randomization and algorithmic enhancements to compensate for solver deficiencies. We implement the parametric stochastic dual dynamic programming algorithm along with the accelerations and enhancements discussed on a real-world hydrothermal energy generation problem and discuss the numerical results.
Degree
thesis:*- Name thesis:degree_name
- Doctor of Philosophy (PhD)
- Level thesis:degree_level
- Dissertation
- Discipline thesis:degree_discipline
- Mathematical Sciences
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Hamlin, Benjamin J
- Contributors dc:contributor
-
- Cheng Guo
- Margaret M Wiecek
- Nathan Adelgren
- Hao Hu
- Matthew Saltzman
Subjects
dc:subject × 8Identifiers
dc:identifier.*- Repository record dc:identifier
- https://open.clemson.edu/all_dissertations/4262