Bounded variation in multi-stage optimization
| dc.contributor.advisor | Buchheim, Christoph | |
| dc.contributor.author | Hügging, Maja Valentina | |
| dc.contributor.referee | Pfetsch, Marc | |
| dc.date.accepted | 2025-10-31 | |
| dc.date.accessioned | 2025-12-12T11:39:09Z | |
| dc.date.available | 2025-12-12T11:39:09Z | |
| dc.date.issued | 2025 | |
| dc.description.abstract | This thesis studies the computational complexity of a multi-stage optimization problem with either penalized or bounded variation. The input of the problem is a sequence of instances (one for each time stage), and the task is to find a sequence of solutions (one for each time stage) that achieves a tradeoff between the quality of the solutions in each time stage and their similarity. The amount of change in the sequence of solutions is quantified by the so-called variation which will be measured time-wise, component-wise, or in total. The variation of the solution sequence is either incorporated into the model by a penalty term or by imposing a hard upper bound in the set of constraints. This gives rise to two related but not equivalent multi-stage problems. When only one binary decision can be made in each stage, the tractability of the problems with either of the three types of variation will be settled by presenting respective compact extended LP-reformulations. A thorough polyhedral study of the problem versions will yield complete, and usually exponentially large, descriptions of the convex hull of feasible solutions in the original variable space and also corresponding efficient separation algorithms. For a higher-dimensional underlying combinatorial problem, the complexity of the problem versions will turn out to depend on the type of variation and also on whether this is penalized or bounded. Indeed, even for an underlying problem as trivial as a selection problem, one version will be strongly NP-hard, while others will be tractable. An oracle-based approach will shift the perspective from a complexity-theoretical one to a rather information-related one in order to investigate the relative complexity of the bounded and penalized problem version with respect to the underlying combinatorial problem. | en |
| dc.identifier.uri | http://hdl.handle.net/2003/44497 | |
| dc.identifier.uri | http://dx.doi.org/10.17877/DE290R-26265 | |
| dc.language.iso | en | |
| dc.subject | Bounded variation | en |
| dc.subject | Computational complexity | en |
| dc.subject | Combinatorial optimization | en |
| dc.subject.ddc | 510 | |
| dc.title | Bounded variation in multi-stage optimization | en |
| dc.type | Text | |
| dc.type.publicationtype | PhDThesis | |
| dcterms.accessRights | open access | |
| eldorado.dnb.deposit | true | |
| eldorado.secondarypublication | false |