Analytical algorithm for constraint relaxation in LP-based optimal power flow

A new algorithm for constraint relaxation to deal with infeasible problems in LP-based optimal power flow is presented, together with results from tests of the algorithm. This algorithm follows an analytical approach. In contrast with the traditional iterative methods, the new approach can spread the violations more evenly among all the bottleneck constraints. The computational requirements of the proposed algorithm are modest, and the number of LP iterations in the infeasible case is greatly reduced, enabling constraint relaxation to be applied for all constraints with the ability to use different engineering weightings or priorities