Abstract
To mitigate the high computational cost of adaptive robust optimization with a mixed-integer recourse objective in real-world power scheduling, a unified mixed-integer linear programming (MILP) solution framework is proposed in this paper. Numerical tests verify the superiority and practicability of the proposed solution framework over the existing decomposition-based solution algorithms.
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.
