{'fraction_non_alphanumeric': 0.011504424778761062, 'fraction_numerical': 0.0, 'mean_word_length': 5.318435754189944, '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}}
OR Practice - Solving Complex Chemical Equilibria Using a Geometric-Programming Based Technique

Determining the composition of a chemical system at equilibrium is an important problem that arises in many fields of science and engineering. For complex equilibria, the use of a digital computer is required. The chemist often finds the use of current computer codes an inefficient and frustrating experience. This paper presents a globally convergent algorithm for the solution of chemical equilibrium problems. This algorithm has been made both efficient and easy to use and is now employed successfully by chemists on important problems. It is based on the application of geometric programming principles to solve systems of nonlinear equations. Although presented in a form that can be quickly understood by the practitioner, the methodology is mathematically rigorous. Computer programs that require no familiarity with the details of the methodology were developed and extensively tested. These programs can be used as general research tools for investigating the solution of nonlinear equations in areas other than chemistry.