A time-consistent Benders decomposition method for multistage distributionally robust stochastic optimization with a scenario tree structure
dc.contributor.author | Yu, H. | |
dc.contributor.author | Sun, Jie | |
dc.contributor.author | Wang, Y. | |
dc.date.accessioned | 2023-04-16T09:37:20Z | |
dc.date.available | 2023-04-16T09:37:20Z | |
dc.date.issued | 2021 | |
dc.identifier.citation | Yu, H. and Sun, J. and Wang, Y. 2021. A time-consistent Benders decomposition method for multistage distributionally robust stochastic optimization with a scenario tree structure. Computational Optimization and Applications. 79 (1): pp. 67-99. | |
dc.identifier.uri | http://hdl.handle.net/20.500.11937/91429 | |
dc.identifier.doi | 10.1007/s10589-021-00266-7 | |
dc.description.abstract |
A computational method is developed for solving time consistent distributionally robust multistage stochastic linear programs with discrete distribution. The stochastic structure of the uncertain parameters is described by a scenario tree. At each node of this tree, an ambiguity set is defined by conditional moment constraints to guarantee time consistency. This method employs the idea of nested Benders decomposition that incorporates forward and backward steps. The backward steps solve some conic programming problems to approximate the cost-to-go function at each node, while the forward steps are used to generate additional trial points. A new framework of convergence analysis is developed to establish the global convergence of the approximation procedure, which does not depend on the assumption of polyhedral structure of the original problem. Numerical results of a practical inventory model are reported to demonstrate the effectiveness of the proposed method. | |
dc.language | English | |
dc.publisher | SPRINGER | |
dc.subject | Science & Technology | |
dc.subject | Technology | |
dc.subject | Physical Sciences | |
dc.subject | Operations Research & Management Science | |
dc.subject | Mathematics, Applied | |
dc.subject | Mathematics | |
dc.subject | Multistage stochastic programming | |
dc.subject | Distributionally robust | |
dc.subject | Scenario tree model | |
dc.subject | Decomposition method | |
dc.subject | LINEAR-PROGRAMS | |
dc.subject | CONVERGENCE | |
dc.subject | ALGORITHM | |
dc.subject | SELECTION | |
dc.title | A time-consistent Benders decomposition method for multistage distributionally robust stochastic optimization with a scenario tree structure | |
dc.type | Journal Article | |
dcterms.source.volume | 79 | |
dcterms.source.number | 1 | |
dcterms.source.startPage | 67 | |
dcterms.source.endPage | 99 | |
dcterms.source.issn | 0926-6003 | |
dcterms.source.title | Computational Optimization and Applications | |
dc.date.updated | 2023-04-16T09:37:20Z | |
curtin.department | School of Elec Eng, Comp and Math Sci (EECMS) | |
curtin.accessStatus | Open access | |
curtin.faculty | Faculty of Science and Engineering | |
curtin.contributor.orcid | Sun, Jie [0000-0001-5611-1672] | |
curtin.contributor.researcherid | Sun, Jie [B-7926-2016] [G-3522-2010] | |
dcterms.source.eissn | 1573-2894 | |
curtin.contributor.scopusauthorid | Sun, Jie [16312754600] [57190212842] | |
curtin.repositoryagreement | V3 |