A Unified MILP Solution Framework for Adaptive Robust Scheduling Problems With Mixed-Integer Recourse Objective

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.