Abstract
Aimed at sufficiently utilizing available data and prior distribution information, we introduce a data-driven Bayesian-type approach to solve multi-stage convex stochastic optimization, which can easily cope with the uncertainty about data process’s distributions and their inter-stage dependence. To unravel the properties of the proposed multi-stage Bayesian expectation optimization (BEO) problem, we establish the consistency of optimal value functions and solutions. Two kinds of algorithms are designed for the numerical solution of single-stage and multi-stage BEO problems, respectively. A queuing system and a multi-stage inventory problem are adopted to numerically demonstrate the advantages and practicality of the new framework and corresponding solution methods, compared with the usual formulations and solution methods for stochastic optimization problems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.