Abstract
Computational studies on two-stage stochastic programming problems indicate that aggregate models have better scale-up properties than disaggregate ones, though the threshold of breaking even may be high. In this paper we attempt to explain this phenomenon, and to lower this threshold. We present the on-demand accuracy approach of Oliveira and Sagastizabal in a form which shows that this approach, when applied to two-stage stochastic programming problems, combines the advantages of the disaggregate and the aggregate models. Moreover, we generalize the on-demand accuracy approach to constrained convex problems, and show how to apply it to risk-averse two-stage stochastic programming problems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
