Christodoulos A. Floudas

This book will present the papers delivered at the first U.S. conference devoted exclusively to global optimization and will thus provide valuable insights into the significant research on the topic that has been emerging during recent years. Held at Princeton University in May 1991, the conference brought together an interdisciplinary group of the most active developers of algorithms for global optimization in order to focus the attention of the mathematical programming community on the unsolved problems and diverse applications of this field. The main subjects addressed at the conference were advances in deterministic and stochastic methods for global optimization, parallel algorithms for global optimization problems, and applications of global optimization. Although global optimization is primarily a mathematical problem, it is relevant to several other disciplines, including computer science, applied mathematics, physical chemistry, molecular biology, statistics, physics, engineering, operations research, communication theory, and economics. Global optimization problems originate from a wide variety of mathematical models of real-world systems. Some of its applications are allocation and location problems and VLSI and data-base design problems. Originally published in 1991. The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These editions preserve the original texts of these important books while presenting them in durable paperback and hardcover editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905.

This book will present the papers delivered at the first U.S. conference devoted exclusively to global optimization and will thus provide valuable insights into the significant research on the topic that has been emerging during recent years. Held at Princeton University in May 1991, the conference brought together an interdisciplinary group of the most active developers of algorithms for global optimization in order to focus the attention of the mathematical programming community on the unsolved problems and diverse applications of this field. The main subjects addressed at the conference were advances in deterministic and stochastic methods for global optimization, parallel algorithms for global optimization problems, and applications of global optimization. Although global optimization is primarily a mathematical problem, it is relevant to several other disciplines, including computer science, applied mathematics, physical chemistry, molecular biology, statistics, physics, engineering, operations research, communication theory, and economics. Global optimization problems originate from a wide variety of mathematical models of real-world systems. Some of its applications are allocation and location problems and VLSI and data-base design problems. Originally published in 1991. The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These editions preserve the original texts of these important books while presenting them in durable paperback and hardcover editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905.

Significant research activities have taken place in the areas of local and global optimization in the last two decades. Many new theoretical, computational, algorithmic, and software contributions have resulted. It has been realized that despite these numerous contributions, there does not exist a systematic forum for thorough experimental computational testing and· evaluation of the proposed optimization algorithms and their implementations. Well-designed nonconvex optimization test problems are of major impor­ tance for academic and industrial researchers interested in algorithmic and software development. It is remarkable that eventhough nonconvex models dominate all the important application areas in engineering and applied sci­ ences, there is only a limited dass of reported representative test problems. This book reflects our long term efforts in designing a benchmark database and it is motivated primarily from the need for nonconvex optimization test problems. The present collection of benchmarks indudes test problems from literature studies and a large dass of applications that arise in several branches of engineering and applied science.

The vast majority of important applications in science, engineering and applied science are characterized by the existence of multiple minima and maxima, as well as first, second and higher order saddle points. The area of Deterministic Global Optimization introduces theoretical, algorithmic and computational ad­ vances that (i) address the computation and characterization of global minima and maxima, (ii) determine valid lower and upper bounds on the global minima and maxima, and (iii) address the enclosure of all solutions of nonlinear con­ strained systems of equations. Global optimization applications are widespread in all disciplines and they range from atomistic or molecular level to process and product level representations. The primary goal of this book is three fold : first, to introduce the reader to the basics of deterministic global optimization; second, to present important theoretical and algorithmic advances for several classes of mathematical prob­ lems that include biconvex and bilinear; problems, signomial problems, general twice differentiable nonlinear problems, mixed integer nonlinear problems, and the enclosure of all solutions of nonlinear constrained systems of equations; and third, to tie the theory and methods together with a variety of important applications.

The vast majority of important applications in science, engineering and applied science are characterized by the existence of multiple minima and maxima, as well as first, second and higher order saddle points. The area of Deterministic Global Optimization introduces theoretical, algorithmic and computational ad­ vances that (i) address the computation and characterization of global minima and maxima, (ii) determine valid lower and upper bounds on the global minima and maxima, and (iii) address the enclosure of all solutions of nonlinear con­ strained systems of equations. Global optimization applications are widespread in all disciplines and they range from atomistic or molecular level to process and product level representations. The primary goal of this book is three fold : first, to introduce the reader to the basics of deterministic global optimization; second, to present important theoretical and algorithmic advances for several classes of mathematical prob­ lems that include biconvex and bilinear; problems, signomial problems, general twice differentiable nonlinear problems, mixed integer nonlinear problems, and the enclosure of all solutions of nonlinear constrained systems of equations; and third, to tie the theory and methods together with a variety of important applications.

Significant research activities have taken place in the areas of local and global optimization in the last two decades. Many new theoretical, computational, algorithmic, and software contributions have resulted. It has been realized that despite these numerous contributions, there does not exist a systematic forum for thorough experimental computational testing and· evaluation of the proposed optimization algorithms and their implementations. Well-designed nonconvex optimization test problems are of major impor­ tance for academic and industrial researchers interested in algorithmic and software development. It is remarkable that eventhough nonconvex models dominate all the important application areas in engineering and applied sci­ ences, there is only a limited dass of reported representative test problems. This book reflects our long term efforts in designing a benchmark database and it is motivated primarily from the need for nonconvex optimization test problems. The present collection of benchmarks indudes test problems from literature studies and a large dass of applications that arise in several branches of engineering and applied science.

This books presents the fundamentals of nonlinear and mixed-integer optimization, and their applications in the important area of process synthesis in chemical engineering. The reader is acquainted with the basics of convex analysis and nonlinear optimization and is introduced to the elementary concepts of mixed-integer linear nonlinear optimization. Topics that are unique include the theory and methods for mixed-integer non-linear optimization, introduction to modeling issues in process synthesis, and optimization-based approaches in the synthesis of heat recovery systems, distillation-based systems, and reactor-based systems. This book fills a gap in available textbooks since there are no other books covering either the fundamentals or applications of nonlinear and mixed-integer optimization. It is designed keeping in mind that it can be used as a graduate textbook in one or two semester courses in nonlinear and mixed-integer optimization and applications in process synthesis, as well as a reference for any engineering student or researcher concerned with continuous and discrete nonlinear optimization issues in engineering design, process synthesis, process operations, applied mathematics and operations research, industrial management, and systems engineering.

Significant research activity has occurred in the area of global optimization in recent years. Many new theoretical, algorithmic, and computational contributions have resulted. Despite the major importance of test problems for researchers, there has been a lack of representative nonconvex test problems for constrained global optimization algorithms. This book is motivated by the scarcity of global optimization test problems and represents the first systematic collection of test problems for evaluating and testing constrained global optimization algorithms. This collection includes problems arising in a variety of engineering applications, and test problems from published computational reports.