Abstract
We demonstrate how adjustable robust optimization (ARO) problems with fixed recourse can be cast as static robust optimization problems via Fourier–Motzkin elimination (FME). Through the lens of FME, we characterize the structures of the optimal decision rules for a broad class of ARO problems. A scheme based on a blending of classical FME and a simple linear programming technique that can efficiently remove redundant constraints is developed to reformulate ARO problems. This generic reformulation technique enhances the classical approximation scheme via decision rules, and it enables us to solve adjustable optimization problems to optimality. We show via numerical experiments that, for small-sized ARO problems, our novel approach finds the optimal solution. For moderate- or large-sized instances, we eliminate a subset of the adjustable variables, which improves the solutions obtained from linear decision rules.
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.