{'fraction_non_alphanumeric': 0.02674591381872214, 'fraction_numerical': 0.0, 'mean_word_length': 5.3584905660377355, '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}}
A simultaneous strategy for dynamic optimization based on symbolic derivation

A novel simultaneous strategy for solving dynamic optimization problems (DOPs), which obtains symbolic derivation of the original problems before discretization, is studied in this work. In this strategy, the discretized nonlinear program (NLP) can be separated into two parts, named model-part and method-part. The model-part is determined by the original DOPs, and the method-part is decided by a collocation method. A solution framework based on symbolic computation is developed to discretize and solve the DOPs. All of these concepts are illustrated with two dynamic optimization examples.