Many complex aeronautical design problems can be formulated with efficient multi-objective evolutionary optimization methods and game strategies. This book describes the role of advanced innovative evolution tools in the solution, or the set of solutions of single or multi disciplinary optimization. These tools use the concept of multi-population, asynchronous parallelization and hierarchical topology which allows different models including precise, intermediate and approximate models with each node belonging to the different hierarchical layer handled by a different Evolutionary Algorithm. The efficiency of evolutionary algorithms for both single and multi-objective optimization problems are significantly improved by the coupling of EAs with games and in particular by a new dynamic methodology named “Hybridized Nash-Pareto games�. Multi objective Optimization techniques and robust design problems taking into account uncertainties are introduced and explained in detail.  Several applications dealing with civil aircraft and UAV, UCAV systems are implemented numerically and discussed.  Applications of increasing optimization complexity are presented as well as two hands-on test cases problems. These examples focus on aeronautical applications and will be useful to the practitioner in the laboratory or in industrial design environments. The evolutionary methods coupled with games presented in this volume can be applied to other areas including surface and marine transport, structures, biomedical engineering, renewable energy and environmental problems. This book will be of interest to students, young scientists and engineers involved in the field of multi physics optimization.

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 book presents the works and research findings of physicists, economists, mathematicians, statisticians, and financial engineers who have undertaken data-driven modelling of market dynamics and other empirical studies in the field of Econophysics. During recent decades, the financial market landscape has changed dramatically with the deregulation of markets and the growing complexity of products. The ever-increasing speed and decreasing costs of computational power and networks have led to the emergence of huge databases. The availability of these data should permit the development of models that are better founded empirically, and econophysicists have accordingly been advocating that one should rely primarily on the empirical observations in order to construct models and validate them. The recent turmoil in financial markets and the 2008 crash appear to offer a strong rationale for new models and approaches. The Econophysics community accordingly has an important future role to play in market modelling. The Econophys-Kolkata VIII conference proceedings are devoted to the presentation of many such modelling efforts and address recent developments. A number of leading researchers from across the globe report on their recent work, comment on the latest issues, and review the contemporary literature.

This book offers a simple introduction to the fundamentals and applications of the Analytic Hierarchy Process (AHP) without a pre-requisite for a sophisticated mathematical background. It provides a quick and intuitive understanding of the methodology using spreadsheet examples and explains in a step-by-step fashion how to use Super Decisions, a freely available software developed by the Creative Decisions Foundations. The book is intended to be a resource for decision makers with little or no exposure to the field of Operations Research (OR); however, the book can be used as a very gentle introduction to the AHP methodology and/or as an AHP hands-on supplement for standard OR textbooks. AHP is an intuitive and mathematically simple methodology in the field of multi-criteria decision making. Because of this, most AHP books assume the reader has basic OR mathematical background. However, AHP simplicity suggests that decision makers from all disciplines can take advantage of the methodology without struggling with the mathematics behind it. To fulfill this need, this book delivers a quick and practical understanding of the method that can be useful for corporate executives.

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.

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).

The focus of this book is on establishing theories and methods of both decision and game analysis in management using intuitionistic fuzzy sets. It proposes a series of innovative theories, models and methods such as the representation theorem and extension principle of intuitionistic fuzzy sets, ranking methods of intuitionistic fuzzy numbers, non-linear and linear programming methods for intuitionistic fuzzy multi-attribute decision making and (interval-valued) intuitionistic fuzzy matrix games. These theories and methods form the theory system of intuitionistic fuzzy decision making and games, which is not only remarkably different from those of the traditional, Bayes and/or fuzzy decision theory but can also provide an effective and efficient tool for solving complex management problems. Since there is a certain degree of inherent hesitancy in real-life management, which cannot always be described by the traditional mathematical methods and/or fuzzy set theory, this book offers an effective approach to using the intuitionistic fuzzy set expressed with membership and non-membership functions. This book is addressed to all those involved in theoretical research and practical applications from a variety of fields/disciplines: decision science, game theory, management science, fuzzy sets, operational research, applied mathematics, systems engineering, industrial engineering, economics, etc.

This volume contains a collection of papers based on lectures and presentations delivered at the International Conference on Constructive Nonsmooth Analysis (CNSA) held in St. Petersburg (Russia) from June 18-23, 2012. This conference was organized to mark the 50th anniversary of the birth of nonsmooth analysis and nondifferentiable optimization and was dedicated to J.-J. Moreau and the late B.N. Pshenichnyi, A.M. Rubinov, and N.Z. Shor, whose contributions to NSA and NDO remain invaluable. The first four chapters of the book are devoted to the theory of nonsmooth analysis. Chapters 5-8 contain new results in nonsmooth mechanics and calculus of variations. Chapters 9-13 are related to nondifferentiable optimization, and the volume concludes with four chapters containing interesting and important historical chapters, including tributes to three giants of nonsmooth analysis, convexity, and optimization: Alexandr Alexandrov, Leonid Kantorovich, and Alex Rubinov. The last chapter provides an overview and important snapshots of the 50-year history of convex analysis and optimization.

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 textbook is devoted to a compressed and self-contained exposition of two important parts of contemporary mathematics: convex and set-valued analysis. In the first part, properties of convex sets, the theory of separation, convex functions and their differentiability, properties of convex cones in finite- and infinite-dimensional spaces are discussed. The second part covers some important parts of set-valued analysis. There the properties of the Hausdorff metric and various continuity concepts of set-valued maps are considered. The great attention is paid also to measurable set-valued functions, continuous, Lipschitz and some special types of selections, fixed point and coincidence theorems, covering set-valued maps, topological degree theory and differential inclusions. Contents: Preface Part I: Convex analysis Convex sets and their properties The convex hull of a set. The interior of convex sets The affine hull of sets. The relative interior of convex sets Separation theorems for convex sets Convex functions Closedness, boundedness, continuity, and Lipschitz property of convex functions Conjugate functions Support functions Differentiability of convex functions and the subdifferential Convex cones A little more about convex cones in infinite-dimensional spaces A problem of linear programming More about convex sets and convex hulls Part II: Set-valued analysis Introduction to the theory of topological and metric spaces The Hausdorff metric and the distance between sets Some fine properties of the Hausdorff metric Set-valued maps. Upper semicontinuous and lower semicontinuous set-valued maps A base of topology of the spaceHc(X) Measurable set-valued maps. Measurable selections and measurable choice theorems The superposition set-valued operator The Michael theorem and continuous selections. Lipschitz selections. Single-valued approximations Special selections of set-valued maps Differential inclusions Fixed points and coincidences of maps in metric spaces Stability of coincidence points and properties of covering maps Topological degree and fixed points of set-valued maps in Banach spaces Existence results for differential inclusions via the fixed point method Notation Bibliography Index

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 gives a complete classification of all algebras with the Kadison-Singer property, when restricting to separable Hilbert spaces. The Kadison-Singer property deals with the following question: given a Hilbert space H and an abelian unital C*-subalgebra A of B(H), does every pure state on A extend uniquely to a pure state on B(H)? This question has deep connections to fundamental aspects of quantum physics, as is explained in the foreword by Klaas Landsman. The book starts with an accessible introduction to the concept of states and continues with a detailed proof of the classification of maximal Abelian von Neumann algebras, a very explicit construction of the Stone-Cech compactification and an account of the recent proof of the Kadison-Singer problem. At the end accessible appendices provide the necessary background material. This elementary account of the Kadison-Singer conjecture is very well-suited for graduate students interested in operator algebras and states, researchers who are non-specialists of the field, and/or interested in fundamental quantum physics.

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.

This book presents an up-to-date review of modeling and optimization approaches for location problems along with a new bi-level programming methodology which captures the effect of competition of both producers and customers on facility location decisions. While many optimization approaches simplify location problems by assuming decision making in isolation, this monograph focuses on models which take into account the competitive environment in which such decisions are made. New insights in modeling, algorithmic and theoretical possibilities are opened by this approach and new applications are possible. Competition on equal term plus competition between market leader and followers are considered in this study, consequently bi-level optimization methodology is emphasized and further developed. This book provides insights regarding modeling complexity and algorithmic approaches to discrete competitive location problems. In traditional location modeling, assignment of customer demands to supply sources are made for which the associated costs target the firm and not the customers, though in many real world situations the cost is incurred by the customers. Moreover, there may be customer competition for the provided services. Thus, a new methodological framework is needed in order to encompass such considerations into the modeling and solution process. This book offers initial directions for further research and development along these lines. Aimed toward graduate students and researchers in the field of mathematics, computer science, operational research and game theory, this title provides necessary information on which further research contributions can be based.

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.

Presenting a study of geometric action functionals (i.e., non-negative functionals on the space of unparameterized oriented rectifiable curves), this monograph focuses on the subclass of those functionals whose local action is a degenerate type of Finsler metric that may vanish in certain directions, allowing for curves with positive Euclidean length but with zero action. For such functionals, criteria are developed under which there exists a minimum action curve leading from one given set to another. Then the properties of this curve are studied, and the non-existence of minimizers is established in some settings. Applied to a geometric reformulation of the quasipotential of Wentzell-Freidlin theory (a subfield of large deviation theory), these results can yield the existence and properties of maximum likelihood transition curves between two metastable states in a stochastic process with small noise. The book assumes only standard knowledge in graduate-level analysis; all higher-level mathematical concepts are introduced along the way.

This book constitutes the refereed proceedings of the 9th International Symposium on Algorithmic Game Theory, SAGT 2016, held in Liverpool, UK, in September 2016.The 26 full papers presented together with 2 one-page abstracts were carefully reviewed and selected from 62 submissions. The accepted submissions cover various important aspectsof algorithmic game theory such as computational aspects of games, congestion games and networks, matching and voting, auctions and markets, and mechanism design.

This book offers a first course in analysis for scientists and engineers. It can be used at the advanced undergraduate level or as part of the curriculum in a graduate program. The book is built around metric spaces. In the first three chapters, the authors lay the foundational material and cover the all-important "four-C's": convergence, completeness, compactness, and continuity. In subsequent chapters, the basic tools of analysis are used to give brief introductions to differential and integral equations, convex analysis, and measure theory. The treatment is modern and aesthetically pleasing. It lays the groundwork for the needs of classical fields as well as the important new fields of optimization and probability theory.

Computer science and economics have engaged in a lively interaction over the past fifteen years, resulting in the new field of algorithmic game theory. Many problems that are central to modern computer science, ranging from resource allocation in large networks to online advertising, involve interactions between multiple self-interested parties. Economics and game theory offer a host of useful models and definitions to reason about such problems. The flow of ideas also travels in the other direction, and concepts from computer science are increasingly important in economics. This book grew out of the author's Stanford University course on algorithmic game theory, and aims to give students and other newcomers a quick and accessible introduction to many of the most important concepts in the field. The book also includes case studies on online advertising, wireless spectrum auctions, kidney exchange, and network management.