{'fraction_non_alphanumeric': 0.011217948717948718, 'fraction_numerical': 0.0, 'mean_word_length': 5.720430107526882, '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}}
Numerical analyses of a directed graph formulation of the multistage distribution expansion problem

In this paper, the numerical analysis of a multistage formulation of the distribution expansion problem developed is presented. The approximate objective function is employed without sacrificing optimality. A complete nonlinear mathematical programming optimization is employed to identify the global optimum. The algorithm is applied here to two practical test cases. Details of the input data and configuration of test systems as well as the solutions are listed and discussed. Computational considerations are addressed.