This book provides an overview of state-of-the-art research on “Systems and Optimization Aspects of Smart Grid Challenges.� The authors have compiled and integrated different aspects of applied systems optimization research to smart grids, and also describe some of its critical challenges and requirements. The promise of a smarter electricity grid could significantly change how consumers use and pay for their electrical power, and could fundamentally reshape the current Industry. Gaining increasing interest and acceptance, Smart Grid technologies combine power generation and delivery systems with advanced communication systems to help save energy, reduce energy costs and improve reliability. Taken together, these technologies support new approaches for load balancing and power distribution, allowing optimal runtime power routing and cost management. Such unprecedented capabilities, however, also present a set of new problems and challenges at the technical and regulatory levels that must be addressed by Industry and the Research Community.

Metaheuristics exhibit desirable properties like simplicity, easy parallelizability and ready applicability to different types of optimization problems such as real parameter optimization, combinatorial optimization and mixed integer optimization. They are thus beginning to play a key role in different industrially important process engineering applications, among them the synthesis of heat and mass exchange equipment, synthesis of distillation columns and static and dynamic optimization of chemical and bioreactors. This book explains cutting-edge research techniques in related computational intelligence domains and their applications in real-world process engineering. It will be of interest to industrial practitioners and research academics.

The main aim of this book is to present several results related to functions of unitary operators on complex Hilbert spaces obtained, by the author in a sequence of recent research papers. The fundamental tools to obtain these results are provided by some new Riemann-Stieltjes integral inequalities of continuous integrands on the complex unit circle and integrators of bounded variation. Features All the results presented are completely proved and the original references where they have been firstly obtained are mentioned Intended for use by both researchers in various fields of Linear Operator Theory and Mathematical Inequalities, as well as by postgraduate students and scientists applying inequalities in their specific areas Provides new emphasis to mathematical inequalities, approximation theory and numerical analysis in a simple, friendly and well-digested manner. About the Author Silvestru Sever Dragomir is Professor and Chair of Mathematical Inequalities at the College of Engineering & Science, Victoria University, Melbourne, Australia. He is the author of many research papers and several books on Mathematical Inequalities and their Applications. He also chairs the international Research Group in Mathematical Inequalities and Applications (RGMIA). For details, see https://rgmia.org/index.php.

This book provides a short and concise introduction to Bayesian optimization specifically for experimental and computational materials scientists. After explaining the basic idea behind Bayesian optimization and some applications to materials science in Chapter 1, the mathematical theory of Bayesian optimization is outlined in Chapter 2. Finally, Chapter 3 discusses an application of Bayesian optimization to a complicated structure optimization problem in computational surface science.Bayesian optimization is a promising global optimization technique that originates in the field of machine learning and is starting to gain attention in materials science. For the purpose of materials design, Bayesian optimization can be used to predict new materials with novel properties without extensive screening of candidate materials. For the purpose of computational materials science, Bayesian optimization can be incorporated into first-principles calculations to perform efficient, global structure optimizations. While research in these directions has been reported in high-profile journals, until now there has been no textbook aimed specifically at materials scientists who wish to incorporate Bayesian optimization into their own research. This book will be accessible to researchers and students in materials science who have a basic background in calculus and linear algebra.

Many of our daily-life problems can be written in the form of an optimization problem. Therefore, solution methods are needed to solve such problems. Due to the complexity of the problems, it is not always easy to find the exact solution. However, approximate solutions can be found. The theory of the best approximation is applicable in a variety of problems arising in nonlinear functional analysis and optimization. This book highlights interesting aspects of nonlinear analysis and optimization together with many applications in the areas of physical and social sciences including engineering. It is immensely helpful for young graduates and researchers who are pursuing research in this field, as it provides abundant research resources for researchers and post-doctoral fellows. This will be a valuable addition to the library of anyone who works in the field of applied mathematics, economics and engineering.

This book describes how evolutionary algorithms (EA), including genetic algorithms (GA) and particle swarm optimization (PSO) can be utilized for solving multi-objective optimization problems in the area of embedded and VLSI system design. Many complex engineering optimization problems can be modelled as multi-objective formulations. This book provides an introduction to multi-objective optimization using meta-heuristic algorithms, GA and PSO and how they can be applied to problems like hardware/software partitioning in embedded systems, circuit partitioning in VLSI, design of operational amplifiers in analog VLSI, design space exploration in high-level synthesis, delay fault testing in VLSI testing and scheduling in heterogeneous distributed systems. It is shown how, in each case, the various aspects of the EA, namely its representation and operators like crossover, mutation, etc, can be separately formulated to solve these problems. This book is intended for design engineers and researchers in the field of VLSI and embedded system design. The book introduces the multi-objective GA and PSO in a simple and easily understandable way that will appeal to introductory readers.

This book deals with optimization methods as tools for decision making and control in the presence of model uncertainty. It is oriented to the use of these tools in engineering, specifically in automatic control design with all its components: analysis of dynamical systems, identification problems, and feedback control design. Developments in Model-Based Optimization and Control takes advantage of optimization-based formulations for such classical feedback design objectives as stability, performance and feasibility, afforded by the established body of results and methodologies constituting optimal control theory. It makes particular use of the popular formulation known as predictive control or receding-horizon optimization. The individual contributions in this volume are wide-ranging in subject matter but coordinated within a five-part structure covering material on: * complexity and structure in model predictive control (MPC); * collaborative MPC; * distributed MPC; * optimization-based analysis and design; and * applications to bioprocesses, multivehicle systems or energy management. The various contributions cover a subject spectrum including inverse optimality and more modern decentralized and cooperative formulations of receding-horizon optimal control. Readers will find fourteen chapters dedicated to optimization-based tools for robustness analysis, and decision-making in relation to feedback mechanisms-fault detection, for example-and three chapters putting forward applications where the model-based optimization brings a novel perspective. Developments in Model-Based Optimization and Control is a selection of contributions expanded and updated from the Optimisation-based Control and Estimation workshops held in November 2013 and November 2014. It forms a useful resource for academic researchers and graduate students interested in the state of the art in predictive control. Control engineers working in model-based optimization and control, particularly in its bioprocess applications will also find this collection instructive.

Optimization in Practice with MATLAB (R) provides a unique approach to optimization education. It is accessible to both junior and senior undergraduate and graduate students, as well as industry practitioners. It provides a strongly practical perspective that allows the student to be ready to use optimization in the workplace. It covers traditional materials, as well as important topics previously unavailable in optimization books (e.g. numerical essentials - for successful optimization). Written with both the reader and the instructor in mind, Optimization in Practice with MATLAB (R) provides practical applications of real-world problems using MATLAB (R), with a suite of practical examples and exercises that help the students link the theoretical, the analytical, and the computational in each chapter. Additionally, supporting MATLAB (R) m-files are available for download via www.cambridge.org.messac. Lastly, adopting instructors will receive a comprehensive solution manual with solution codes along with lectures in PowerPoint with animations for each chapter, and the text's unique flexibility enables instructors to structure one- or two-semester courses.

The focus of the present volume is stochastic optimization of dynamical systems in discrete time where - by concentrating on the role of information regarding optimization problems - it discusses the related discretization issues. There is a growing need to tackle uncertainty in applications of optimization. For example the massive introduction of renewable energies in power systems challenges traditional ways to manage them. This book lays out basic and advanced tools to handle and numerically solve such problems and thereby is building a bridge between Stochastic Programming and Stochastic Control. It is intended for graduates readers and scholars in optimization or stochastic control, as well as engineers with a background in applied mathematics.

This is the first comprehensive introduction to the powerful moment approach for solving global optimization problems (and some related problems) described by polynomials (and even semi-algebraic functions). In particular, the author explains how to use relatively recent results from real algebraic geometry to provide a systematic numerical scheme for computing the optimal value and global minimizers. Indeed, among other things, powerful positivity certificates from real algebraic geometry allow one to define an appropriate hierarchy of semidefinite (SOS) relaxations or LP relaxations whose optimal values converge to the global minimum. Several extensions to related optimization problems are also described. Graduate students, engineers and researchers entering the field can use this book to understand, experiment with and master this new approach through the simple worked examples provided.

This is the first comprehensive introduction to the powerful moment approach for solving global optimization problems (and some related problems) described by polynomials (and even semi-algebraic functions). In particular, the author explains how to use relatively recent results from real algebraic geometry to provide a systematic numerical scheme for computing the optimal value and global minimizers. Indeed, among other things, powerful positivity certificates from real algebraic geometry allow one to define an appropriate hierarchy of semidefinite (SOS) relaxations or LP relaxations whose optimal values converge to the global minimum. Several extensions to related optimization problems are also described. Graduate students, engineers and researchers entering the field can use this book to understand, experiment with and master this new approach through the simple worked examples provided.

Very little has been published on optimization of pharmaceutical portfolios. Moreover, most of published literature is coming from the commercial side, where probability of technical success (PoS) is treated as fixed, and not as a consequence of development strategy or design. In this book there is a strong focus on impact of study design on PoS and ultimately on the value of portfolio. Design options that are discussed in different chapters are dose-selection strategies, adaptive design and enrichment. Some development strategies that are discussed are indication sequencing, optimal number of programs and optimal decision criteria. This book includes chapters written by authors with very broad backgrounds including financial, clinical, statistical, decision sciences, commercial and regulatory. Many authors have long held executive positions and have been involved with decision making at a product or at a portfolio level. As such, it is expected that this book will attract a very broad audience, including decision makers in pharmaceutical R&D, commercial and financial departments. The intended audience also includes portfolio planners and managers, statisticians, decision scientists and clinicians. Early chapters describe approaches to portfolio optimization from big Pharma and Venture Capital standpoints. They have stronger focus on finances and processes. Later chapters present selected statistical and decision analysis methods for optimizing drug development programs and portfolios. Some methodological chapters are technical; however, with a few exceptions they require a relatively basic knowledge of statistics by a reader.

This book is the first easy-to-read text on nonsmooth optimization (NSO, not necessarily differentiable optimization). Solving these kinds of problems plays a critical role in many industrial applications and real-world modeling systems, for example in the context of image denoising, optimal control, neural network training, data mining, economics and computational chemistry and physics. The book covers both the theory and the numerical methods used in NSO and provide an overview of different problems arising in the field. It is organized into three parts: 1. convex and nonconvex analysis and the theory of NSO; 2. test problems and practical applications; 3. a guide to NSO software. The book is ideal for anyone teaching or attending NSO courses. As an accessible introduction to the field, it is also well suited as an independent learning guide for practitioners already familiar with the basics of optimization.

Classical decision theory evaluates entire worlds, specified so as to include everything a decision-maker cares about. Thus applying decision theory requires performing computations far beyond an ordinary decision-maker's ability. In this book Paul Weirich explains how individuals can simplify and streamline their choices. He shows how different 'parts' of options (intrinsic, temporal, spatiotemporal, causal) are separable, so that we can know what difference one part makes to the value of an option, regardless of what happens in the other parts. He suggests that the primary value of options is found in basic intrinsic attitudes towards outcomes: desires, aversions, or indifferences. And using these two facts he argues that we need only compare small parts of the options we face in order to make a rational decision. This important book will interest readers in decision theory, economics, and the behavioral sciences.

This book presents the latest findings on stochastic dynamic programming models and on solving optimal control problems in networks. It includes the authors' new findings on determining the optimal solution of discrete optimal control problems in networks and on solving game variants of Markov decision problems in the context of computational networks. First, the book studies the finite state space of Markov processes and reviews the existing methods and algorithms for determining the main characteristics in Markov chains, before proposing new approaches based on dynamic programming and combinatorial methods. Chapter two is dedicated to infinite horizon stochastic discrete optimal control models and Markov decision problems with average and expected total discounted optimization criteria, while Chapter three develops a special game-theoretical approach to Markov decision processes and stochastic discrete optimal control problems. In closing, the book's final chapter is devoted to finite horizon stochastic control problems and Markov decision processes. The algorithms developed represent a valuable contribution to the important field of computational network theory.

This book on PDE Constrained Optimization contains contributions on the mathematical analysis and numerical solution of constrained optimal control and optimization problems where a partial differential equation (PDE) or a system of PDEs appears as an essential part of the constraints. The appropriate treatment of such problems requires a fundamental understanding of the subtle interplay between optimization in function spaces and numerical discretization techniques and relies on advanced methodologies from the theory of PDEs and numerical analysis as well as scientific computing. The contributions reflect the work of the European Science Foundation Networking Programme ’Optimization with PDEs’ (OPTPDE).

This book investigates several duality approaches for vector optimization problems, while also comparing them. Special attention is paid to duality for linear vector optimization problems, for which a vector dual that avoids the shortcomings of the classical ones is proposed. Moreover, the book addresses different efficiency concepts for vector optimization problems. Among the problems that appear when the framework is generalized by considering set-valued functions, an increasing interest is generated by those involving monotone operators, especially now that new methods for approaching them by means of convex analysis have been developed. Following this path, the book provides several results on different properties of sums of monotone operators.

The International Conference on Health Care Systems Engineering (HCSE) provided a timely opportunity to discuss statistical analysis and operations management issues in health care delivery systems. The conference took place in Milan between May 22nd and 24th, 2013. Scientists and practitioners discussed new ideas, methods and technologies for improving the operation of health care organizations. The event and this resulting volume emphasize research in the field of health care systems engineering developed in close collaboration with clinicians. Topics applicable to researchers and practitioners include: hospital drug logistics, operating theatres, modelling and simulation in patient care and healthcare organizations, home care services.

Statistical Decision Problems presents a quick and concise introduction into the theory of risk, deviation and error measures that play a key role in statistical decision problems. It introduces state-of-the-art practical decision making through twenty-one case studies from real-life applications. The case studies cover a broad area of topics and the authors include links with source code and data, a very helpful tool for the reader. In its core, the text demonstrates how to use different factors to formulate statistical decision problems arising in various risk management applications, such as optimal hedging, portfolio optimization, cash flow matching, classification, and more. The presentation is organized into three parts: selected concepts of statistical decision theory, statistical decision problems, and case studies with portfolio safeguard. The text is primarily aimed at practitioners in the areas of risk management, decision making, and statistics. However, the inclusion of a fair bit of mathematical rigor renders this monograph an excellent introduction to the theory of general error, deviation, and risk measures for graduate students. It can be used as supplementary reading for graduate courses including statistical analysis, data mining, stochastic programming, financial engineering, to name a few. The high level of detail may serve useful to applied mathematicians, engineers, and statisticians interested in modeling and managing risk in various applications.

This book shows how the use of S-variables (SVs) in enhancing the range of problems that can be addressed with the already-versatile linear matrix inequality (LMI) approach to control can, in many cases, be put on a more unified, methodical footing. Beginning with the fundamentals of the SV approach, the text shows how the basic idea can be used for each problem (and when it should not be employed at all). The specific adaptations of the method necessitated by each problem are also detailed. The problems dealt with in the book have the common traits that: analytic closed-form solutions are not available; and LMIs can be applied to produce numerical solutions with a certain amount of conservatism. Typical examples are robustness analysis of linear systems affected by parametric uncertainties and the synthesis of a linear controller satisfying multiple, often conflicting, design specifications. For problems in which LMI methods produce conservative results, the SV approach is shown to achieve greater accuracy. The authors emphasize the simplicity and easy comprehensibility of the SV approach and show how it can be implemented in programs without difficulty so that its power becomes readily apparent. The S-variable Approach to LMI-based Robust Control is a useful reference for academic control researchers, applied mathematicians and graduate students interested in LMI methods and convex optimization and will also be of considerable assistance to practising control engineers faced with problems of conservatism in their systems and controllers.

This book examines the problem of maintenance planning and scheduling in industrial production systems. It presents two practically relevant, deterministic mathematical models: the capacitated planned maintenance problem (CPMP) and the weighted uncapacitated planned maintenance problem (WUPMP). It introduces specific optimization algorithms such as construction heuristics, Lagrangean and tabu search metaheuristics. A problem independent hybrid approach links and alternates between two Lagrangean relaxations. It also analyzes the solvability with respect to the computational complexity of several problem classes, polyhedral properties and lower bounds. Computational studies demonstrate the performance of the heuristics, lower bounds, subgradients obtained from heuristics and the quality of dual information. This unique book includes implementation details and an introduction to the necessary theory making it suitable for upper undergraduate students.

The authors present a new formal framework for finding the long-run competitive market equilibrium through short-run equilibria by exploiting the operating policies and plant valuations. This "short-run approach" develops ideas of Boiteux and Koopmans. Applied to the peak-load pricing of electricity generated by thermal, hydro and pumped-storage plants, it gives a sound and practical method of valuing the fixed assets-in this case, the river flows and the geological sites suitable for reservoirs. Its main mathematical basis is the producer's short-run profit maximization programme and its dual; their solutions have relatively simple forms that can greatly ease the fixed-point problem of solving for the general equilibrium. Since the optimal values (profit and cost functions) are usually nondifferentiable-this is so when there are joint costs of production such as capacity constraints-nonsmooth calculus is employed to resolve long-standing discrepancies between textbook theory and industrial reality by giving subdifferential extensions of basic results of microeconomics, including the Wong-Viner Envelope Theorem.

Optimization has long been a source of both inspiration and applications for geometers, and conversely, discrete and convex geometry have provided the foundations for many optimization techniques, leading to a rich interplay between these subjects. The purpose of the Workshop on Discrete Geometry, the Conference on Discrete Geometry and Optimization, and the Workshop on Optimization, held in September 2011 at the Fields Institute, Toronto, was to further stimulate the interaction between geometers and optimizers. This volume reflects the interplay between these areas. The inspiring Fejes Toth Lecture Series, delivered by Thomas Hales of the University of Pittsburgh, exemplified this approach. While these fields have recently witnessed a lot of activity and successes, many questions remain open. For example, Fields medalist Stephen Smale stated that the question of the existence of a strongly polynomial time algorithm for linear optimization is one of the most important unsolved problems at the beginning of the 21st century. The broad range of topics covered in this volume demonstrates the many recent and fruitful connections between different approaches, and features novel results and state-of-the-art surveys as well as open problems.

With the proliferation of Software-as-a-Service (SaaS) offerings, it is becoming increasingly important for individual SaaS providers to operate their services at a low cost. This book investigates SaaS from the perspective of the provider and shows how operational costs can be reduced by using "multi tenancy," a technique for consolidating a large number of customers onto a small number of servers. Specifically, the book addresses multi tenancy on the database level, focusing on in-memory column databases, which are the backbone of many important new enterprise applications. For efficiently implementing multi tenancy in a farm of databases, two fundamental challenges must be addressed, (i) workload modeling and (ii) data placement. The first involves estimating the (shared) resource consumption for multi tenancy on a single in-memory database server. The second consists in assigning tenants to servers in a way that minimizes the number of required servers (and thus costs) based on the assumed workload model. This step also entails replicating tenants for performance and high availability. This book presents novel solutions to both problems.

In 1958, Ralph E. Gomory transformed the field of integer programming when he published a paper that described a cutting-plane algorithm for pure integer programs and announced that the method could be refined to give a finite algorithm for integer programming. In 2008, to commemorate the anniversary of this seminal paper, a special workshop celebrating fifty years of integer programming was held in Aussois, France, as part of the 12th Combinatorial Optimization Workshop. It contains reprints of key historical articles and written versions of survey lectures on six of the hottest topics in the field by distinguished members of the integer programming community. Useful for anyone in mathematics, computer science and operations research, this book exposes mathematical optimization, specifically integer programming and combinatorial optimization, to a broad audience.