{'fraction_non_alphanumeric': 0.011527377521613832, 'fraction_numerical': 0.0009606147934678194, 'mean_word_length': 5.2023809523809526, '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 Study of Aggregation as a Modeling Tool in Optimal Design

In this article we examine the behavior of optimal design models when the parameters are progressively unfixed in a process referred to as design aggregation. While this is a common modeling practice, its consequences on solution properties are not always predictable. Using no special assumptions on problem data, we develop an upper bound result for the aggregation process and highlight the difficulties which arise when even a single parameter is unfixed. When such an aggregated model is in turn parametrically decomposed, we recover the result where sufficiency at the lower level is required for necessary optimality conditions at the upper level. We also present a generalization of the commonly studied “portal frame” problem as a design case study. While aggregation has only benign effects on the solution of this model, interesting new results are obtained when model perturbations more severe than simple aggregation are imposed on this problem. 1corresponding author