{'fraction_non_alphanumeric': 0.017408123791102514, 'fraction_numerical': 0.0, 'mean_word_length': 5.556962025316456, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Incorporating Squirrel-Cage Induction Machine Models in Convex Relaxations of OPF Problems

The optimal power flow (OPF) problem determines a minimum cost operating point for an electric power system. Recently developed convex relaxations are capable of globally solving certain OPF problems. Using a semidefinite relaxation of the OPF problem as an illustrative example, this letter presents a method for extending convex relaxations of the OPF problem to include steady-state squirrel-cage induction machine models.