An Evaluation of Algorithms to Solve for Do-Not-Exceed Limits for Renewable Resources

As power systems become more reliant on intermittent resources, system operators are faced with the fact that the availability of intermittent resources is beyond human control and largely unpredictable. Due to the lack of compliance from intermittent resources to follow strict dispatch instructions, the dispatch instruction for an intermittent resource is proposed to be a desired dispatch range or a do-not-exceed (DNE) limit. In this paper, a two-stage robust optimization problem determines the DNE limits, which define the region where the system is guaranteed to reliably handle any wind realization within the specified DNE limit range. Two algorithms are implemented in this paper, each of which can handle the bilinear sub-problem in this two-stage problem. The results show that local search algorithms do not perform well when compared to a big-M based MILP reformulation. All numerical results are based on the IEEE-118 bus test system.