{'fraction_non_alphanumeric': 0.020446096654275093, 'fraction_numerical': 0.0037174721189591076, 'mean_word_length': 5.410714285714286, '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 compromise programming method using multibounds formulation and dual approach for multicriteria structural optimization

To enhance the reliability and efficiency of the multicriteria optimization procedure, a compromise programming method using multibounds formulation (MBF) is proposed in this paper. This method can be used either to obtain the Pareto optimum set or to find the ‘best’ Pareto optimum solution in the sense of having the minimum distance to the utopia point. By introducing a set of artificial design variables, it is shown that a simplified and easy‐to‐use formulation can be established for practical applications. Particularly, this formulation is well adapted to the efficient dual solution approach due to the convexity of objective function. Theoretically, based on the Kuhn–Tucker optimality conditions, demonstrations show that the new formulation is equivalent to its original form and thus retains the basic properties of the latter. Numerical examples will be solved to show the capacity of this method. Copyright © 2003 John Wiley & Sons, Ltd.