LAUSR

Optimal dispatch of modern power systems often entails efficiently solving large-scale optimization problems, especially when generators have to respond to the fast fluctuation of renewable generation. This paper develops a method to learn the optimal strategy from a mixed-integer quadratic program with time-varying parameters, which can model many power system operation problems such as unit commitment and optimal power flow. Different from existing machine learning methods that learn a map from the parameter to the optimal action, the proposed method learns the map from the parameter to the optimal integer solution and the optimal basis, forming a discrete pattern. Such a framework naturally gives rise to a classification problem: the parameter set is partitioned into polyhedral regions; in each region, the optimal 0-1 variable and the set of active constraints remain unchanged, and the optimal continuous variables are affine functions in the parameter. The outcome of classification is compared with analytical results derived from multi-parametric programming theory, showing interesting connections between traditional mathematical programming theory and the interpretability of the learning-based method. Tests on a small-scale problem demonstrate the partition of the parameter set learned from data meets the theoretical outcome. More tests on the IEEE 57-bus system and a real-world 1881-bus system validate the performance of the proposed method with a high-dimensional parameter for which the analytical method is intractable.