Abstract
We propose a new class of stochastic integer programs whose special features are dominance constraints induced by mixed-integer linear recourse. For these models, we establish closedness of the constraint set mapping with the underlying probability measure as a parameter. In the case of finite probability spaces, the models are shown to be equivalent to large-scale, block-structured, mixed-integer linear programs. We propose a decomposition algorithm for the latter and discuss computational results.
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.
