{'fraction_non_alphanumeric': 0.02088167053364269, 'fraction_numerical': 0.0, 'mean_word_length': 6.073770491803279, '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}}
An Effective Computational Algorithm for a Class of Linear Multiplicative Programming

In this paper, an effective computational algorithm is proposed for a class of linear multiplicative problem (P), which have broad applications in financial optimization, economic plan, engineering designs and stability analysis of nonlinear systems, and so on. By utilizing piecewise linearization technique underestimates the objective function, linear relaxation programming of the original linear multiplicative programming problem (P) is established, and the proposed global optimization algorithm is convergent to the global optimal solution of the original problem (P). And finally the numerical experiments are given to illustrate that the feasibility of proposed algorithm and can be used to globally solve the class of linear multiplicative programming problem (P).