Nonlinearoptimizationproblemscontainingbothcontinuousanddiscretevariables are called mixed integer nonlinear programs (MINLP). Such problems arise in many ?elds, such as process industry, engineering design, communications, and ?nance. There is currently a huge gap between MINLP and mixed integer linear programming(MIP) solvertechnology.With a modernstate-of-the-artMIP solver itispossibletosolvemodelswithmillionsofvariablesandconstraints,whereasthe dimensionofsolvableMINLPsisoftenlimitedbyanumberthatissmallerbythree or four orders of magnitude. It is theoretically possible to approximate a general MINLP by a MIP with arbitrary precision. However, good MIP approximations are usually much larger than the original problem. Moreover, the approximation of nonlinear functions by piecewise linear functions can be di?cult and ti- consuming. In this book relaxation and decomposition methods for solving nonconvex structured MINLPs are proposed. In particular, a generic branch-cut-and-price (BCP) framework for MINLP is presented. BCP is the underlying concept in almost all modern MIP solvers. Providing a powerful decomposition framework for both sequential and parallel solvers, it made the success of the current MIP technology possible. So far generic BCP frameworks have been developed only for MIP, for example,COIN/BCP (IBM, 2003) andABACUS (OREAS GmbH, 1999). In order to generalize MIP-BCP to MINLP-BCP, the following points have to be taken into account: • A given (sparse) MINLP is reformulated as a block-separable program with linear coupling constraints.The block structure makes it possible to generate Lagrangian cuts and to apply Lagrangian heuristics. • In order to facilitate the generation of polyhedral relaxations, nonlinear c- vex relaxations are constructed. • The MINLP separation and pricing subproblems for generating cuts and columns are solved with specialized MINLP solvers.

Many engineering, operations, and scientific applications include a mixture of discrete and continuous decision variables and nonlinear relationships involving the decision variables that have a pronounced effect on the set of feasible and optimal solutions. Mixed-integer nonlinear programming (MINLP) problems combine the numerical difficulties of handling nonlinear functions with the challenge of optimizing in the context of nonconvex functions and discrete variables. MINLP is one of the most flexible modeling paradigms available for optimization; but because its scope is so broad, in the most general cases it is hopelessly intractable. Nonetheless, an expanding body of researchers and practitioners — including chemical engineers, operations researchers, industrial engineers, mechanical engineers, economists, statisticians, computer scientists, operations managers, and mathematical programmers — are interested in solving large-scale MINLP instances.

The goal of the Encyclopedia of Optimization is to introduce the reader to a complete set of topics that show the spectrum of research, the richness of ideas, and the breadth of applications that has come from this field. The second edition builds on the success of the former edition with more than 150 completely new entries, designed to ensure that the reference addresses recent areas where optimization theories and techniques have advanced. Particularly heavy attention resulted in health science and transportation, with entries such as "Algorithms for Genomics", "Optimization and Radiotherapy Treatment Design", and "Crew Scheduling".

Optimization plainly dominates the design, planning, operation, and c- trol of engineering systems. This is a book on optimization that considers particular cases of optimization problems, those with a decomposable str- ture that can be advantageously exploited. Those decomposable optimization problems are ubiquitous in engineering and science applications. The book considers problems with both complicating constraints and complicating va- ables, and analyzes linear and nonlinear problems, with and without in- ger variables. The decomposition techniques analyzed include Dantzig-Wolfe, Benders, Lagrangian relaxation, Augmented Lagrangian decomposition, and others. Heuristic techniques are also considered. Additionally, a comprehensive sensitivity analysis for characterizing the solution of optimization problems is carried out. This material is particularly novel and of high practical interest. This book is built based on many clarifying, illustrative, and compu- tional examples, which facilitate the learning procedure. For the sake of cl- ity, theoretical concepts and computational algorithms are assembled based on these examples. The results are simplicity, clarity, and easy-learning. We feel that this book is needed by the engineering community that has to tackle complex optimization problems, particularly by practitioners and researchersinEngineering,OperationsResearch,andAppliedEconomics.The descriptions of most decomposition techniques are available only in complex and specialized mathematical journals, di?cult to understand by engineers. A book describing a wide range of decomposition techniques, emphasizing problem-solving, and appropriately blending theory and application, was not previously available.

Multi-Objective Optimization in Theory and Practice is a traditional two-part approach to solving multi-objective optimization (MOO) problems namely the use of classical methods and evolutionary algorithms. This first book is devoted to classical methods including the extended simplex method by Zeleny and preference-based techniques. This part covers three main topics through nine chapters. The first topic focuses on the design of such MOO problems, their complexities including nonlinearities and uncertainties, and optimality theory. The second topic introduces the founding solving methods including the extended simplex method to linear MOO problems and weighting objective methods. The third topic deals with particular structures of MOO problems, such as mixed-integer programming, hierarchical programming, fuzzy logic programming, and bimatrix games. Multi-Objective Optimization in Theory and Practice is a user-friendly book with detailed, illustrated calculations, examples, test functions, and small-size applications in Mathematica® (among other mathematical packages) and from scholarly literature. It is an essential handbook for students and teachers involved in advanced optimization courses in engineering, information science, and mathematics degree programs.

In this book, theory of large scale optimization is introduced with case studies of real-world problems and applications of structured mathematical modeling. The large scale optimization methods are represented by various theories such as Benders’ decomposition, logic-based Benders’ decomposition, Lagrangian relaxation, Dantzig –Wolfe decomposition, multi-tree decomposition, Van Roy’ cross decomposition and parallel decomposition for mathematical programs such as mixed integer nonlinear programming and stochastic programming. Case studies of large scale optimization in supply chain management, smart manufacturing, and Industry 4.0 are investigated with efficient implementation for real-time solutions. The features of case studies cover a wide range of fields including the Internet of things, advanced transportation systems, energy management, supply chain networks, service systems, operations management, risk management, and financial and sales management. Instructors, graduate students, researchers, and practitioners, would benefit from this book finding the applicability of large scale optimization in asynchronous parallel optimization, real-time distributed network, and optimizing the knowledge-based expert system for convex and non-convex problems.

Filling a void in chemical engineering and optimization literature, this book presents the theory and methods for nonlinear and mixed-integer optimization, and their applications in the important area of process synthesis. Other topics include modeling issues in process synthesis, and optimization-based approaches in the synthesis of heat recovery systems, distillation-based systems, and reactor-based systems. The basics of convex analysis and nonlinear optimization are also covered and the elementary concepts of mixed-integer linear optimization are introduced. All chapters have several illustrations and geometrical interpretations of the material as well as suggested problems. Nonlinear and Mixed-Integer Optimization will prove to be an invaluable source--either as a textbook or a reference--for researchers and graduate students interested in continuous and discrete nonlinear optimization issues in engineering design, process synthesis, process operations, applied mathematics, operations research, industrial management, and systems engineering.

Process Systems Engineering brings together the international community of researchers and engineers interested in computing-based methods in process engineering. This conference highlights the contributions of the PSE community towards the sustainability of modern society and is based on the 13th International Symposium on Process Systems Engineering PSE 2018 event held San Diego, CA, July 1-5 2018. The book contains contributions from academia and industry, establishing the core products of PSE, defining the new and changing scope of our results, and future challenges. Plenary and keynote lectures discuss real-world challenges (globalization, energy, environment and health) and contribute to discussions on the widening scope of PSE versus the consolidation of the core topics of PSE. - Highlights how the Process Systems Engineering community contributes to the sustainability of modern society - Establishes the core products of Process Systems Engineering - Defines the future challenges of Process Systems Engineering

Classical and Recent Aspects of Power System Optimization presents conventional and meta-heuristic optimization methods and algorithms for power system studies. The classic aspects of optimization in power systems, such as optimal power flow, economic dispatch, unit commitment and power quality optimization are covered, as are issues relating to distributed generation sizing, allocation problems, scheduling of renewable resources, energy storage, power reserve based problems, efficient use of smart grid capabilities, and protection studies in modern power systems. The book brings together innovative research outcomes, programs, algorithms and approaches that consolidate the present state and future challenges for power. - Analyzes and compares several aspects of optimization for power systems which has never been addressed in one reference - Details real-life industry application examples for each chapter (e.g. energy storage and power reserve problems) - Provides practical training on theoretical developments and application of advanced methods for optimum electrical energy for realistic engineering problems