{'fraction_non_alphanumeric': 0.01652892561983471, 'fraction_numerical': 0.0, 'mean_word_length': 5.298701298701299, '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}}
Extensions of the k-Elliptic Optimization Approach and a Computer Method for Location Decision

Some closely related location problems subject to given constraints are considered. With the aid of the k-elliptic optimization approach, a minimax problem is solved. This approach is further developed with a view to solving location problems involving nonconvex level surfaces. Last, a computer method for constructing level curves of a certain class of objective functions is described.