Simon Thomä, Maximilian Schiffer, Wolfram Wiesemann
{"title":"A Note on Piecewise Affine Decision Rules for Robust, Stochastic, and Data-Driven Optimization","authors":"Simon Thomä, Maximilian Schiffer, Wolfram Wiesemann","doi":"arxiv-2409.10295","DOIUrl":null,"url":null,"abstract":"Multi-stage decision-making under uncertainty, where decisions are taken\nunder sequentially revealing uncertain problem parameters, is often essential\nto faithfully model managerial problems. Given the significant computational\nchallenges involved, these problems are typically solved approximately. This\nshort note introduces an algorithmic framework that revisits a popular\napproximation scheme for multi-stage stochastic programs by Georghiou et al.\n(2015) and improves upon it to deliver superior policies in the stochastic\nsetting, as well as extend its applicability to robust optimization and a\ncontemporary Wasserstein-based data-driven setting. We demonstrate how the\npolicies of our framework can be computed efficiently, and we present numerical\nexperiments that highlight the benefits of our method.","PeriodicalId":501286,"journal":{"name":"arXiv - MATH - Optimization and Control","volume":"15 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Optimization and Control","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.10295","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Multi-stage decision-making under uncertainty, where decisions are taken
under sequentially revealing uncertain problem parameters, is often essential
to faithfully model managerial problems. Given the significant computational
challenges involved, these problems are typically solved approximately. This
short note introduces an algorithmic framework that revisits a popular
approximation scheme for multi-stage stochastic programs by Georghiou et al.
(2015) and improves upon it to deliver superior policies in the stochastic
setting, as well as extend its applicability to robust optimization and a
contemporary Wasserstein-based data-driven setting. We demonstrate how the
policies of our framework can be computed efficiently, and we present numerical
experiments that highlight the benefits of our method.