{"title":"Approximation of multistage stochastic programming problems by smoothed quantization","authors":"","doi":"10.1007/s11846-024-00733-5","DOIUrl":null,"url":null,"abstract":"<h3>Abstract</h3> <p>We present an approximation technique for solving multistage stochastic programming problems with an underlying Markov stochastic process. This process is approximated by a discrete skeleton process, which is consequently smoothed down by means of the original unconditional distribution. Approximated in this way, the problem is solvable by means of Markov Stochastic Dual Dynamic Programming. We state an upper bound for the nested distance between the exact process and its approximation and discuss its convergence in the one-dimensional case. We further propose an adjustment of the approximation, which guarantees that the approximate problem is bounded. Finally, we apply our technique to a real-life production-emission trading problem and demonstrate the performance of its approximation given the “true” distribution of the random parameters.</p>","PeriodicalId":20992,"journal":{"name":"Review of Managerial Science","volume":"26 1","pages":""},"PeriodicalIF":7.8000,"publicationDate":"2024-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Review of Managerial Science","FirstCategoryId":"91","ListUrlMain":"https://doi.org/10.1007/s11846-024-00733-5","RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MANAGEMENT","Score":null,"Total":0}
引用次数: 0
Abstract
We present an approximation technique for solving multistage stochastic programming problems with an underlying Markov stochastic process. This process is approximated by a discrete skeleton process, which is consequently smoothed down by means of the original unconditional distribution. Approximated in this way, the problem is solvable by means of Markov Stochastic Dual Dynamic Programming. We state an upper bound for the nested distance between the exact process and its approximation and discuss its convergence in the one-dimensional case. We further propose an adjustment of the approximation, which guarantees that the approximate problem is bounded. Finally, we apply our technique to a real-life production-emission trading problem and demonstrate the performance of its approximation given the “true” distribution of the random parameters.
期刊介绍:
Review of Managerial Science (RMS) provides a forum for innovative research from all scientific areas of business administration. The journal publishes original research of high quality and is open to various methodological approaches (analytical modeling, empirical research, experimental work, methodological reasoning etc.). The scope of RMS encompasses – but is not limited to – accounting, auditing, banking, business strategy, corporate governance, entrepreneurship, financial structure and capital markets, health economics, human resources management, information systems, innovation management, insurance, marketing, organization, production and logistics, risk management and taxation. RMS also encourages the submission of papers combining ideas and/or approaches from different areas in an innovative way. Review papers presenting the state of the art of a research area and pointing out new directions for further research are also welcome. The scientific standards of RMS are guaranteed by a rigorous, double-blind peer review process with ad hoc referees and the journal´s internationally composed editorial board.