The book addresses optimization in the petroleum industry from a practical, large-scale-application-oriented point of view. The models and techniques presented help to optimize the limited resources in the industry in order to maximize economic benefits, ensure operational safety, and reduce environmental impact. The book discusses several important real-life applications of optimization in the petroleum industry, ranging from the scheduling of personnel time to the blending of gasoline. It covers a wide spectrum of relevant activities, including drilling, producing, maintenance, and distribution. The text begins with an introductory overview of the petroleum industry and then of optimization models and techniques. The main body of the book details a variety of applications of optimization models and techniques within the petroleum industry. Applied  Optimization in the Petroleum Industry helps readers to find effective optimization-based solutions to their own practical problems in a large and important industrial sector, still the main source of the world’s energy and the source of raw materials for a wide variety of industrial and consumer products.

This book covers an introduction to convex optimization, one of the powerful and tractable optimization problems that can be efficiently solved on a computer. The goal of the book is tohelp develop a sense of what convex optimization is, and how it can be used in a widening array of practical contexts with a particular emphasis on machine learning.The first part of the book covers core concepts of convex sets, convex functions, and related basic definitions that serve understanding convex optimization and its corresponding models. The second part deals with one very useful theory, called duality, which enables us to: (1) gain algorithmic insights; and (2) obtain an approximate solution to non-convex optimization problems which are often difficult to solve. The last part focuses on modern applications in machine learning and deep learning.A defining feature of this book is that it succinctly relates the "story" of how convex optimization plays a role, via historical examples and trending machine learning applications. Another key feature is that it includes programming implementation of a variety of machine learning algorithms inspired by optimization fundamentals, together with a brief tutorial of the used programming tools. The implementation is based on Python, CVXPY, and TensorFlow. This book does not follow a traditional textbook-style organization, but is streamlined via a series of lecture notes that are intimately related, centered around coherent themes and concepts. It serves as a textbook mainly for a senior-level undergraduate course, yet is also suitable for a first-year graduate course. Readers benefit from having a good background in linear algebra, some exposure to probability, and basic familiarity with Python.

Nature-Inspired Optimization Algorithms provides a systematic introduction to all major nature-inspired algorithms for optimization. The book's unified approach, balancing algorithm introduction, theoretical background and practical implementation, complements extensive literature with well-chosen case studies to illustrate how these algorithms work. Topics include particle swarm optimization, ant and bee algorithms, simulated annealing, cuckoo search, firefly algorithm, bat algorithm, flower algorithm, harmony search, algorithm analysis, constraint handling, hybrid methods, parameter tuning and control, as well as multi-objective optimization. This book can serve as an introductory book for graduates, doctoral students and lecturers in computer science, engineering and natural sciences. It can also serve a source of inspiration for new applications. Researchers and engineers as well as experienced experts will also find it a handy reference.

Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three volumes of the Combinatorial Optimization series aim to cover a wide range of topics in this area. These topics also deal with fundamental notions and approaches as with several classical applications of combinatorial optimization. Concepts of Combinatorial Optimization, is divided into three parts: - On the complexity of combinatorial optimization problems, presenting basics about worst-case and randomized complexity; - Classical solution methods, presenting the two most-known methods for solving hard combinatorial optimization problems, that are Branch-and-Bound and Dynamic Programming; - Elements from mathematical programming, presenting fundamentals from mathematical programming based methods that are in the heart of Operations Research since the origins of this field.

Optimization techniques have developed into a modern-day solution for real-world problems in various industries. As a way to improve performance and handle issues of uncertainty, optimization research becomes a topic of special interest across disciplines. Problem Solving and Uncertainty Modeling through Optimization and Soft Computing Applications presents the latest research trends and developments in the area of applied optimization methodologies and soft computing techniques for solving complex problems. Taking a multi-disciplinary approach, this critical publication is an essential reference source for engineers, managers, researchers, and post-graduate students.

Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three volumes of the Combinatorial Optimization series aim to cover a wide range of topics in this area. These topics also deal with fundamental notions and approaches as with several classical applications of combinatorial optimization. Concepts of Combinatorial Optimization, is divided into three parts: - On the complexity of combinatorial optimization problems, presenting basics about worst-case and randomized complexity; - Classical solution methods, presenting the two most-known methods for solving hard combinatorial optimization problems, that are Branch-and-Bound and Dynamic Programming; - Elements from mathematical programming, presenting fundamentals from mathematical programming based methods that are in the heart of Operations Research since the origins of this field.

The book systematically introduces smart power system design and its infrastructure, platform and operating standards. It focuses on multi-objective optimization and illustrates where the intelligence of the system lies. With abundant project data, this book is a practical guideline for engineers and researchers in electrical engineering, as well as power network designers and managers in administration.

This bookdescribes computational financetools. It covers fundamental numerical analysis and computational techniques, such asoption pricing, and givesspecial attention tosimulation and optimization. Many chapters are organized as case studies aroundportfolio insurance and risk estimation problems. In particular, several chapters explain optimization heuristics and how to use them for portfolio selection and in calibration of estimation and option pricing models. Such practical examples allow readers to learn the steps for solving specific problems and apply these steps to others. At the same time, the applications are relevant enough to make the book a useful reference. Matlab and R sample code is provided in the text and can be downloaded from the book's website.
Shows ways to build and implement tools that help test ideasFocuses on the application of heuristics; standard methods receive limited attentionPresents as separate chapters problems from portfolio optimization, estimation of econometric models, and calibration of option pricing models"

Computational fluid dynamics (CFD) and optimal shape design (OSD) are of practical importance for many engineering applications - the aeronautic, automobile, and nuclear industries are all major users of these technologies.
Giving the state of the art in shape optimization for an extended range of applications, this new edition explains the equations needed to understand OSD problems for fluids (Euler and Navier Strokes, but also those for microfluids) and covers numerical simulation techniques. Automatic differentiation, approximate gradients, unstructured mesh adaptation, multi-model configurations, and time-dependent problems are introduced, illustrating how these techniques are implemented within the industrial environments of the aerospace and automobile industries.
With the dramatic increase in computing power since the first edition, methods that were previously unfeasible have begun giving results. The book remains primarily one on differential shape optimization, but the coverage of evolutionary algorithms, topological optimization methods, and level set algortihms has been expanded so that each of these methods is now treated in a separate chapter.
Presenting a global view of the field with simple mathematical explanations, coding tips and tricks, analytical and numerical tests, and exhaustive referencing, the book will be essential reading for engineers interested in the implementation and solution of optimization problems. Whether using commercial packages or in-house solvers, or a graduate or researcher in aerospace or mechanical engineering, fluid dynamics, or CFD, the second edition will help the reader understand and solve design problems in this exciting area of research and development, and will prove especially useful in showing how to apply the methodology to practical problems.

This book provides an overview of radar waveform synthesis obtained as the result of computational optimization processes and covers the most challenging application fields. The book balances a practical point of view with a rigorous mathematical approach corroborated with a wealth of numerical study cases and some real experiments. Additionally, the book has a cross-disciplinary approach because it exploits cross-fertilization with the recent research and discoveries in optimization theory. The material of the book is organized into ten chapters, each one completed with a comprehensive list of references. The following topics are covered: recent advances of binary sequence designs and their applications; quadratic optimization for unimodular sequence synthesis and applications; a computational design of phase-only (possibly binary) sequences for radar systems; constrained radar code design for spectrally congested environments via quadratic optimization; robust transmit code and receive filter design for extended targets detection in clutter; optimizing radar transceiver for Doppler processing via non-convex programming; radar waveform design via the majorization-minimization framework; Lagrange programming neural network for radar waveform design; cognitive local ambiguity function shaping with spectral coexistence and experiments; and relative entropy based waveform design for MIMO radar. Targeted at an audience of radar engineers and researchers, this book provides thorough and up-to-date coverage of optimisation theory for radar waveform design.

It has widely been recognized that submodular functions play essential roles in efficiently solvable combinatorial optimization problems. Since the publication of the 1st edition of this book fifteen years ago, submodular functions have been showing further increasing importance in optimization, combinatorics, discrete mathematics, algorithmic computer science, and algorithmic economics, and there have been made remarkable developments of theory and algorithms in submodular functions. The 2nd edition of the book supplements the 1st edition with a lot of remarks and with new two chapters: "Submodular Function Minimization" and "Discrete Convex Analysis." The present 2nd edition is still a unique book on submodular functions, which is essential to students and researchers interested in combinatorial optimization, discrete mathematics, and discrete algorithms in the fields of mathematics, operations research, computer science, and economics.

Key features:

- Self-contained exposition of the theory of submodular functions.
- Selected up-to-date materials substantial to future developments.
- Polyhedral description of Discrete Convex Analysis.
- Full description of submodular function minimization algorithms.
- Effective insertion of figures.
- Useful in applied mathematics, operations research, computer science, and economics.
- Self-contained exposition of the theory of submodular functions.
- Selected up-to-date materials substantial to future developments.
- Polyhedral description of Discrete Convex Analysis.
- Full description of submodular function minimization algorithms.
- Effective insertion of figures.
- Useful in applied mathematics, operations research, computer science, and economics.

The engineering and business problems the world faces today have become more impenetrable and unstructured, making the design of a satisfactory problem-specific algorithm nontrivial. Modeling, Analysis, and Applications in Metaheuristic Computing: Advancements and Trends is a collection of the latest developments, models, and applications within the transdisciplinary fields related to metaheuristic computing. Providing researchers, practitioners, and academicians with insight into a wide range of topics such as genetic algorithms, differential evolution, and ant colony optimization, this book compiles the latest findings, analysis, improvements, and applications of technologies within metaheuristic computing.

This monograph studies optimization problems for rigid punches in elastic media and for high-speed penetration of rigid strikers into deformed elastoplastic, concrete, and composite media using variational calculations, tools from functional analysis, and stochastic and min-max (guaranteed) optimization approaches with incomplete data. The book presents analytical and numerical results developed by the authors during the last ten years.

This book introduces and analyses the latest maximum power point tracking (MPPT) techniques, which can effectively reduce the cost of power generated from photovoltaic energy systems. It also presents a detailed description, analysis, and comparison of various MPPT techniques applied to stand-alone systems and those interfaced with electric utilities, examining their performance under normal and abnormal operating conditions. These techniques, which and can be conventional or smart, are a current hot topic, and this book is a valuable reference resource for academic researchers and industry professionals who are interested in exploring and implementing advanced MPPT for photovoltaic systems. It is also useful for graduate students who are looking to expand their knowledge of MPPT techniques.

This book includes a collection of articles that present recent developments in the fields of optimization and dynamic game theory, economic dynamics, dynamic theory of the firm, and population dynamics and non standard applications of optimal control theory. The authors of the articles are well respected authorities in their fields and are known for their high quality research in the fields of optimization and economic dynamics.

This book introduces readers to the use of R codes for optimization problems. First, it provides the necessary background to understand data envelopment analysis (DEA), with a special emphasis on fuzzy DEA. It then describes DEA models, including fuzzy DEA models, and shows how to use them to solve optimization problems with R. Further, it discusses the main advantages of R in optimization problems, and provides R codes based on real-world data sets throughout. Offering a comprehensive review of DEA and fuzzy DEA models and the corresponding R codes, this practice-oriented reference guide is intended for masters and Ph.D. students in various disciplines, as well as practitioners and researchers.

This book introduces readers to the background, general framework, main operators, and other basic characteristics of biogeography-based optimization (BBO), which is an emerging branch of bio-inspired computation. In particular, the book presents the authors' recent work on improved variants of BBO, hybridization of BBO with other algorithms, and the application of BBO to a variety of domains including transportation, image processing, and neural network learning. The content will help to advance research into and application of not only BBO but also the whole field of bio-inspired computation. The algorithms and applications are organized in a step-by-step manner and clearly described with the help of pseudo-codes and flowcharts. The readers will learn not only the basic concepts of BBO but also how to apply and adapt the algorithms to the engineering optimization problems they actually encounter.

The research and review papers presented in this volume provide an overview of the main issues, findings, and open questions in cutting-edge research on the fields of modeling, optimization and dynamics and their applications to biology, economics, energy, finance, industry, physics and psychology. Given the scientific relevance of the innovative applications and emerging issues they address, the contributions to this volume, written by some of the world's leading experts in mathematics, economics and other applied sciences, will be seminal to future research developments and will spark future works and collaborations. The majority of the papers presented in this volume were written by participants of the 4th International Conference on Dynamics, Games and Science: Decision Models in a Complex Economy (DGS IV), held at the National Distance Education University (UNED) in Madrid, Spain in June 2016 and of the 8th Berkeley Bioeconomy Conference: The Future of Biofuels, held at the UC Berkeley Alumni House in April 2015.

This monograph presents new theories and methods for fixed-time cooperative control of multi-agent systems. Fundamental concepts of fixed-time stability and stabilization are introduced with insightful understanding. This book presents solutions for several problems of fixed-time cooperative control using systematic design methods. The book compares fixed-time cooperative control with asymptotic cooperative control, demonstrating how the former can achieve better closed-loop performance and disturbance rejection properties. It also discusses the differences from finite-time control, and shows how fixed-time cooperative control can produce the faster rate of convergence and provide an explicit estimate of the settling time independent of initial conditions. This monograph presents multiple applications of fixed-time control schemes, including to distributed optimization of multi-agent systems, making it useful to students, researchers and engineers alike.