This is a collection of papers by participants at High Dimensional Probability VI Meeting held from October 9-14, 2011 at the Banff International Research Station in Banff, Alberta, Canada. High Dimensional Probability (HDP) is an area of mathematics that includes the study of probability distributions and limit theorems in infinite-dimensional spaces such as Hilbert spaces and Banach spaces. The most remarkable feature of this area is that it has resulted in the creation of powerful new tools and perspectives, whose range of application has led to interactions with other areas of mathematics, statistics, and computer science. These include random matrix theory, nonparametric statistics, empirical process theory, statistical learning theory, concentration of measure phenomena, strong and weak approximations, distribution function estimation in high dimensions, combinatorial optimization, and random graph theory. The papers in this volume show that HDP theory continues to develop new tools, methods, techniques and perspectives to analyze the random phenomena. Both researchers and advanced students will find this book of great use for learning about new avenues of research.

This judicious selection of articles combines mathematical and numerical methods to apply parameter estimation and optimum experimental design in a range of contexts. These include fields as diverse as biology, medicine, chemistry, environmental physics, image processing and computer vision. The material chosen was presented at a multidisciplinary workshop on parameter estimation held in 2009 in Heidelberg. The contributions show how indispensable efficient methods of applied mathematics and computer-based modeling can be to enhancing the quality of interdisciplinary research. The use of scientific computing to model, simulate, and optimize complex processes has become a standard methodology in many scientific fields, as well as in industry. Demonstrating that the use of state-of-the-art optimization techniques in a number of research areas has much potential for improvement, this book provides advanced numerical methods and the very latest results for the applications under consideration.

"Optimal Observation for Cyber-physical Systems" addresses the challenge, fundamental to the design of wireless sensor networks (WSNs), presented by the obligatory trade-off between precise estimates and system constraints. A unified theoretical framework, based on the well-established theory of optimal experimental design and providing consistent solutions to problems hitherto requiring a variety of approaches, is put forward to solve a large class of optimal observation problems. The Fisher information matrix plays a key role in this framework and makes it feasible to provide analytical solutions to some complex and important questions which could not be answered in the past. Readers with an applied background in WSN implementation will find all the understanding of the key theory of optimal experimental design they need within this book. The use of multiple examples to illustrate the theoretical parts of the book brings the subject into sharper focus than would an abstract theoretical disquisition.

This is a short tract on the essentials of differential and symplectic geometry together with a basic introduction to several applications of this rich framework: analytical mechanics, the calculus of variations, conjugate points & Morse index, and other physical topics. A central feature is the systematic utilization of Lagrangian submanifolds and their Maslov-Hoermander generating functions. Following this line of thought, first introduced by Wlodemierz Tulczyjew, geometric solutions of Hamilton-Jacobi equations, Hamiltonian vector fields and canonical transformations are described by suitable Lagrangian submanifolds belonging to distinct well-defined symplectic structures. This unified point of view has been particularly fruitful in symplectic topology, which is the modern Hamiltonian environment for the calculus of variations, yielding sharp sufficient existence conditions. This line of investigation was initiated by Claude Viterbo in 1992; here, some primary consequences of this theory are exposed in Chapter 8: aspects of Poincare's last geometric theorem and the Arnol'd conjecture are introduced. In Chapter 7 elements of the global asymptotic treatment of the highly oscillating integrals for the Schroedinger equation are discussed: as is well known, this eventually leads to the theory of Fourier Integral Operators. This short handbook is directed toward graduate students in Mathematics and Physics and to all those who desire a quick introduction to these beautiful subjects.

This book contains a selection of refereed papers presented at the "International Conference on Operations Research (OR 2013)" which took place at Erasmus University Rotterdam September 3-6, 2013. The conference was jointly organized by the German and the Dutch OR Society. More than 800 scientists and students from over 50 countries attended OR 2013 and presented more than 600 papers in parallel topical streams, as well as special award sessions. The theme of the conference and its proceedings is "Impact on People, Business and Society".

VII Preface In many fields of mathematics, geometry has established itself as a fruitful method and common language for describing basic phenomena and problems as well as suggesting ways of solutions. Especially in pure mathematics this is ob vious and well-known (examples are the much discussed interplay between lin ear algebra and analytical geometry and several problems in multidimensional analysis). On the other hand, many specialists from applied mathematics seem to prefer more formal analytical and numerical methods and representations. Nevertheless, very often the internal development of disciplines from applied mathematics led to geometric models, and occasionally breakthroughs were b ed on geometric insights. An excellent example is the Klee-Minty cube, solving a problem of linear programming by transforming it into a geomet ric problem. Also the development of convex programming in recent decades demonstrated the power of methods that evolved within the field of convex geometry. The present book focuses on three applied disciplines: control theory, location science and computational geometry. It is our aim to demonstrate how methods and topics from convex geometry in a wider sense (separation theory of convex cones, Minkowski geometry, convex partitionings, etc.) can help to solve various problems from these disciplines."

This book offers an exposition of the main applications of Nonlinear Analysis, beginning with a chapter on Nonlinear Operators and Fixed Points, a connecting point and bridge from Nonlinear Analysis theory to its applications. The topics covered include applications to ordinary and partial differential equations, optimization, optimal control, calculus of variations and mathematical economics. The presentation is supplemented with the inclusion of many exercises and their solutions.

An Introduction to Nonlinear Analysis: Theory is an overview of some basic, important aspects of Nonlinear Analysis, with an emphasis on those not included in the classical treatment of the field. Today Nonlinear Analysis is a very prolific part of modern mathematical analysis, with fascinating theory and many different applications ranging from mathematical physics and engineering to social sciences and economics. Topics covered in this book include the necessary background material from topology, measure theory and functional analysis (Banach space theory). The text also deals with multivalued analysis and basic features of nonsmooth analysis, providing a solid background for the more applications-oriented material of the book An Introduction to Nonlinear Analysis: Applications by the same authors.

The book is self-contained and accessible to the newcomer, complete with numerous examples, exercises and solutions. It is a valuable tool, not only for specialists in the field interested in technical details, but also for scientists entering Nonlinear Analysis in search of promising directions for research.

Geared primarily to an audience consisting of mathematically advanced undergraduate or beginning graduate students, this text may additionally be used by engineering students interested in a rigorous, proof-oriented systems course that goes beyond the classical frequency-domain material and more applied courses. The minimal mathematical background required is a working knowledge of linear algebra and differential equations. The book covers what constitutes the common core of control theory and is unique in its emphasis on foundational aspects. While covering a wide range of topics written in a standard theorem/proof style, it also develops the necessary techniques from scratch. In this second edition, new chapters and sections have been added, dealing with time optimal control of linear systems, variational and numerical approaches to nonlinear control, nonlinear controllability via Lie-algebraic methods, and controllability of recurrent nets and of linear systems with bounded controls.

The purpose of this book is to present a self-contained description of the fun damentals of the theory of nonlinear control systems, with special emphasis on the differential geometric approach. The book is intended as a graduate text as weil as a reference to scientists and engineers involved in the analysis and design of feedback systems. The first version of this book was written in 1983, while I was teach ing at the Department of Systems Science and Mathematics at Washington University in St. Louis. This new edition integrates my subsequent teaching experience gained at the University of Illinois in Urbana-Champaign in 1987, at the Carl-Cranz Gesellschaft in Oberpfaffenhofen in 1987, at the University of California in Berkeley in 1988. In addition to a major rearrangement of the last two Chapters of the first version, this new edition incorporates two additional Chapters at a more elementary level and an exposition of some relevant research findings which have occurred since 1985."

This volume brings forth a set of papers presented at the conference on "Varia tional Inequalities and network equilibrium problems," held in Erice at the "G. Stam pacchia" School of the "E. Majorana" Centre for Scientific Culture in the period 19 25 June 1994. The meeting was conceived to contribute to the exchange between Variational Analysis and equilibrium problems, especially those related to network design. Most of the approaches and viewpoints of these fields are present in the volume, both as concerns the theory and the applications of equilibrium problems to transportation, computer and electric networks, to market behavior, and to bi level programming. Being convinced of the great importance of equilibrium problems as well as of their complexity, the organizers hope that the merging of points of view coming from differ ent fields will stimulate theoretical research and applications. In this context Variational and Quasi Variational Inequalities have shown them selves to be very important models for equilibrium problems. As a consequence in the last two decades they have received a lot of attention both as to mathematical inves tigation and applications. The proof that the above mentioned equilibrium problems can be expressed, in terms of Variational or Quasi Variational Inequalities also in the non standard and non symmetric cases, has been a crucial improvement."

The generalized area of multiple criteria decision making (MCDM) can be defined as the body of methods and procedures by which the concern for multiple conflicting criteria can be formally incorporated into the analytical process. MCDM consists mostly of two branches, multiple criteria optimization and multi-criteria decision analysis (MCDA). While MCDA is typically concerned with multiple criteria problems that have a small number of alternatives often in an environment of uncertainty (location of an airport, type of drug rehabilitation program), multiple criteria optimization is typically directed at problems formulated within a mathematical programming framework, but with a stack of objectives instead of just one (river basin management, engineering component design, product distribution). It is about the most modern treatment of multiple criteria optimization that this book is concerned. I look at this book as a nicely organized and well-rounded presentation of what I view as "new wave" topics in multiple criteria optimization. Looking back to the origins of MCDM, most people agree that it was not until about the early 1970s that multiple criteria optimization c- gealed as a field. At this time, and for about the following fifteen years, the focus was on theories of multiple objective linear programming that subsume conventional (single criterion) linear programming, algorithms for characterizing the efficient set, theoretical vector-maximum dev- opments, and interactive procedures.

Analysis and Optimization of Differential Systems focuses on the qualitative aspects of deterministic and stochastic differential equations. Areas covered include: Ordinary and partial differential systems; Optimal control of deterministic and stochastic evolution equations; Control theory of Partial Differential Equations (PDE's); Optimization methods in PDE's with numerous applications to mechanics and physics; Inverse problems; Stability theory; Abstract optimization problems; Calculus of variations; Numerical treatment of solutions to differential equations and related optimization problems. These research fields are under very active development and the present volume should be of interest to students and researchers working in applied mathematics or in system engineering. This volume contains selected contributions presented during the International Working Conference on Analysis and Optimization of Differential Systems, which was sponsored by the International Federation for Information Processing (IFIP) and held in Constanta, Romania in September 2002. Among the aims of this conference was the creation of new international contacts and collaborations, taking advantage of the new developments in Eastern Europe, particularly in Romania. The conference benefited from the support of the European Union via the EURROMMAT program.

System Modelling and Optimization covers research issues within systems theory, optimization, modelling, and computing. It includes contributions to structural mechanics, integer programming, nonlinear programming, interior point methods, dynamical systems, stability analysis, stochastic optimization, bilevel optimization, and semidefinite programming. Several survey papers written by leading experts in their fields complement new developments in theory and applications. This book contains most of the invited papers and a few carefully selected submitted papers that were presented at the 19th IFIP TC7 Conference on System Modelling and Optimization, which was held in Cambridge, England, from July 12 to 16, 1999, and sponsored by the International Federation for Information Processing (IFIP).

The Handbook is a comprehensive research reference that is essential for anyone interested in conducting research in supply chain. Unique features include: -A focus on the intersection of quantitative supply chain analysis and E-Business, -Unlike other edited volumes in the supply chain area, this is a handbook rather than a collection of research papers. Each chapter was written by one or more leading researchers in the area. These authors were invited on the basis of their scholarly expertise and unique insights in a particular sub-area, -As much attention is given to looking back as to looking forward. Most chapters discuss at length future research needs and research directions from both theoretical and practical perspectives, -Most chapters describe in detail the quantitative models used for analysis and the theoretical underpinnings; many examples and case studies are provided to demonstrate how the models and the theoretical insights are relevant to real situations, -Coverage of most state-of-the-art business practices in supply chain management.

System Modeling and Optimization XX deals with new developments in the areas of optimization, optimal control and system modeling. The themes range across various areas of optimization: continuous and discrete, numerical and analytical, finite and infinite dimensional, deterministic and stochastic, static and dynamic, theory and applications, foundations and case studies. Besides some classical topics, modern areas are also presented in the contributions, including robust optimization, filter methods, optimization of power networks, data mining and risk control. This volume contains invited and selected papers from presentations at the 20th IFIP TC7 Conference on System Modeling and Optimization, which took place at the University of Trier, Germany from July 23 to 27, 2001, and which was sponsored by the International Federation for Information Processing (IFIP).

In this global society, manufacturers compete in many ways, and information infrastructures play a critical role in ensuring the right information is available at the right time and the right place to support informed decision making. The traditional approach that assumes all information can be located on a single mainframe and accessed by everybody in the enterprise has fallen by the wayside, and new infrastructures supporting extended or virtual enterprises and globally distributed supply chains are becoming increasingly vital to successful, competitive organizations. Functions, data, and information must be made be available to all without regard to location, accessibility, or the ability to view in a native format. This book is a result of a conference, which brought together a number of leading experts from around the world that work on topics related to the design, implementation, and use of information infrastructures for manufacturing. These experts presented their views on the state of the art, and on a wide variety of topics related to the title. The topics range from the establishment of a generic enterprise framework, which can be used for the design of a supporting information infrastructure to details of how geometric surfaces should be merged together. Although not an exhaustive publication, we believe that the publications in this book represent the state of the art in this research is essential reading for anyone who is attempting the design or development of an information infrastructure for all aspects of Manufacturing.

Andrew Russell Forsyth (1858-1942) was an influential Scottish mathematician notable for incorporating the advances of Continental mathematics within the British tradition. Originally published in 1927, this book constitutes Forsyth's attempt at a systematic exposition of the calculus of variations. It was created as the antidote to a perceived lack of continuity in the development of the topic. Ambitious and highly detailed, this book will be of value to anyone with an interest in the calculus of variations and the history of mathematics in general.

The field of multiple criteria decision analysis (MCDA), also termed multiple criteria decision aid, or multiple criteria decision making (MCDM), has developed rapidly over the past quarter century and in the process a number of divergent schools of thought have emerged. This can make it difficult for a new entrant into the field to develop a comprehensive appreciation of the range of tools and approaches which are available to assist decision makers in dealing with the ever-present difficulties of seeking compromise or consensus between conflicting inter ests and goals, i.e. the "multiple criteria". The diversity of philosophies and models makes it equally difficult for potential users of MCDA, i.e. management scientists and/or decision makers facing problems involving conflicting goals, to gain a clear understanding of which methodologies are appropriate to their particular context. Our intention in writing this book has been to provide a compre hensive yet widely accessible overview of the main streams of thought within MCDA. We aim to provide readers with sufficient awareness of the underlying philosophies and theories, understanding of the practi cal details of the methods, and insight into practice to enable them to implement any of the approaches in an informed manner. As the title of the book indicates, our emphasis is on developing an integrated view of MCDA, which we perceive to incorporate both integration of differ ent schools of thought within MCDA, and integration of MCDA with broader management theory, science and practice.

This book deals with optimality conditions, algorithms, and discretization tech niques for nonlinear programming, semi-infinite optimization, and optimal con trol problems. The unifying thread in the presentation consists of an abstract theory, within which optimality conditions are expressed in the form of zeros of optimality junctions, algorithms are characterized by point-to-set iteration maps, and all the numerical approximations required in the solution of semi-infinite optimization and optimal control problems are treated within the context of con sistent approximations and algorithm implementation techniques. Traditionally, necessary optimality conditions for optimization problems are presented in Lagrange, F. John, or Karush-Kuhn-Tucker multiplier forms, with gradients used for smooth problems and subgradients for nonsmooth prob lems. We present these classical optimality conditions and show that they are satisfied at a point if and only if this point is a zero of an upper semicontinuous optimality junction. The use of optimality functions has several advantages. First, optimality functions can be used in an abstract study of optimization algo rithms. Second, many optimization algorithms can be shown to use search directions that are obtained in evaluating optimality functions, thus establishing a clear relationship between optimality conditions and algorithms. Third, estab lishing optimality conditions for highly complex problems, such as optimal con trol problems with control and trajectory constraints, is much easier in terms of optimality functions than in the classical manner. In addition, the relationship between optimality conditions for finite-dimensional problems and semi-infinite optimization and optimal control problems becomes transparent.

Mathematics of Fuzzy Sets: Logic, Topology and Measure Theory is a major attempt to provide much-needed coherence for the mathematics of fuzzy sets. Much of this book is new material required to standardize this mathematics, making this volume a reference tool with broad appeal as well as a platform for future research. Fourteen chapters are organized into three parts: mathematical logic and foundations (Chapters 1-2), general topology (Chapters 3-10), and measure and probability theory (Chapters 11-14). Chapter 1 deals with non-classical logics and their syntactic and semantic foundations. Chapter 2 details the lattice-theoretic foundations of image and preimage powerset operators. Chapters 3 and 4 lay down the axiomatic and categorical foundations of general topology using lattice-valued mappings as a fundamental tool. Chapter 3 focuses on the fixed-basis case, including a convergence theory demonstrating the utility of the underlying axioms. Chapter 4 focuses on the more general variable-basis case, providing a categorical unification of locales, fixed-basis topological spaces, and variable-basis compactifications. Chapter 5 relates lattice-valued topologies to probabilistic topological spaces and fuzzy neighborhood spaces. Chapter 6 investigates the important role of separation axioms in lattice-valued topology from the perspective of space embedding and mapping extension problems, while Chapter 7 examines separation axioms from the perspective of Stone-Cech-compactification and Stone-representation theorems. Chapters 8 and 9 introduce the most important concepts and properties of uniformities, including the covering and entourage approaches and the basic theory of precompact or complete [0,1]-valued uniform spaces. Chapter 10 sets out the algebraic, topological, and uniform structures of the fundamentally important fuzzy real line and fuzzy unit interval. Chapter 11 lays the foundations of generalized measure theory and representation by Markov kernels. Chapter 12 develops the important theory of conditioning operators with applications to measure-free conditioning. Chapter 13 presents elements of pseudo-analysis with applications to the Hamilton Jacobi equation and optimization problems. Chapter 14 surveys briefly the fundamentals of fuzzy random variables which are [0,1]-valued interpretations of random sets.

Project scheduling problems are, generally speaking, the problems of allocating scarce resources over time to perform a given set of activities. The resources are nothing other than the arbitrary means which activities complete for. Also the activities can have a variety of interpretations. Thus, project scheduling problems appear in a large spectrum of real-world situations, and, in consequence, they have been intensively studied for almost fourty years. Almost a decade has passed since the multi-author monograph: R. Slowinski, 1. W~glarz (eds. ), Advances in Project Scheduling, Elsevier, 1989, summarizing the state-of-the-art across project scheduling problems, was published. Since then, considerable progress has been made in all directions of modelling and finding solutions to these problems. Thus, the proposal by Professor Frederick S. Hillier to edit a handbook which reports on the recent advances in the field came at an exceptionally good time and motivated me to accept the challenge. Fortunately, almost all leading experts in the field have accepted my invitation and presented their completely new advances often combined with expository surveys. Thanks to them, the handbook stands a good chance of becoming a key reference point on the current state-of-the-art in project scheduling, as well as on new directions in the area. The contents are divided into four parts. The first one, dealing with classical models -exact algorithms, is preceded by a proposition of the classification scheme for scheduling problems.

Eugene A. Feinberg Adam Shwartz This volume deals with the theory of Markov Decision Processes (MDPs) and their applications. Each chapter was written by a leading expert in the re spective area. The papers cover major research areas and methodologies, and discuss open questions and future research directions. The papers can be read independently, with the basic notation and concepts ofSection 1.2. Most chap ters should be accessible by graduate or advanced undergraduate students in fields of operations research, electrical engineering, and computer science. 1.1 AN OVERVIEW OF MARKOV DECISION PROCESSES The theory of Markov Decision Processes-also known under several other names including sequential stochastic optimization, discrete-time stochastic control, and stochastic dynamic programming-studiessequential optimization ofdiscrete time stochastic systems. The basic object is a discrete-time stochas tic system whose transition mechanism can be controlled over time. Each control policy defines the stochastic process and values of objective functions associated with this process. The goal is to select a "good" control policy. In real life, decisions that humans and computers make on all levels usually have two types ofimpacts: (i) they cost orsavetime, money, or other resources, or they bring revenues, as well as (ii) they have an impact on the future, by influencing the dynamics. In many situations, decisions with the largest immediate profit may not be good in view offuture events. MDPs model this paradigm and provide results on the structure and existence of good policies and on methods for their calculation."

The literature on equilibrium behavior of customers and servers in queuing systems is rich. However, there is no comprehensive survey of this field. Moreover, what has been published lacks continuity and leaves many issues uncovered. One of the main goals of this book is to review the existing literature under one cover. Other goals are to edit the known results in a unified manner, classify them and identify where and how they relate to each other, and fill in some gaps with new results. In some areas we explicitly mention open problems. We hope that this survey will motivate further research and enable researchers to identify important open problems. The models described in this book have numerous applications. Many examples can be found in the cited papers, but we have chosen not to include applications in the book. Many of the ideas described in this book are special cases of general principles in Economics and Game Theory. We often cite references that contain more general treatment of a subject, but we do not go into the details. we have highlighted the results For each topic covered in the book, that, in our opinion, are the most important. We also present a brief discussion of related results. The content of each chapter is briefly de scribed below. Chapter 1 is an introduction. It contains basic definitions, models and solution concepts which will be used frequently throughout the book.

Semidefinite programming (SDP) is one of the most exciting and active research areas in optimization. It has and continues to attract researchers with very diverse backgrounds, including experts in convex programming, linear algebra, numerical optimization, combinatorial optimization, control theory, and statistics. This tremendous research activity has been prompted by the discovery of important applications in combinatorial optimization and control theory, the development of efficient interior-point algorithms for solving SDP problems, and the depth and elegance of the underlying optimization theory. The Handbook of Semidefinite Programming offers an advanced and broad overview of the current state of the field. It contains nineteen chapters written by the leading experts on the subject. The chapters are organized in three parts: Theory, Algorithms, and Applications and Extensions.