Mathematical Puzzle Tales from Mount Olympus uses fascinating tales from Greek Mythology as the background for introducing mathematics puzzles to the general public. A background in high school mathematics will be ample preparation for using this book, and it should appeal to anyone who enjoys puzzles and recreational mathematics. Features: Combines the arts and science, and emphasizes the fact that mathematics straddles both domains. Great resource for students preparing for mathematics competitions, and the trainers of such students.

This volume covers recent developments in the design, operation, and management of mobile telecommunication and computer systems.

Uncertainty regarding loading and system parameters leads to challenging optimization and robustness issues. Stochastic modeling combined with optimization theory ensures the optimum end-to-end performance of telecommunication or computer network systems. In view of the diverse design options possible, supporting models have many adjustable parameters and choosing the best set for a particular performance objective is delicate and time-consuming. An optimization based approach determines the optimal possible allocation for these parameters.

Researchers and graduate students working at the interface of telecommunications and operations research will benefit from this book. Due to the practical approach, this book will also serve as a reference tool for scientists and engineers in telecommunication and computer networks who depend upon optimization.

The primary objective underlying the Handbook on Modelling for Discrete Optimization is to demonstrate and detail the pervasive nature of Discrete Optimisation. While its applications cut across an wide range of activities, many of the applications are only known to specialists. The aim of this handbook is to correct this. It has long been recognized that modelling is a critically important mathematical activity in designing algorithms for solving these discrete optimization problems. Nevertheless solving the resultant models is also often far from straightforward. In recent years, it has become possible to solve many large-scale discrete optimization problems. However, some problems remain a challenge, even though advances in mathematical methods, hardware, and software technology have pushed the frontiers forward. This handbook couples the difficult, critical-thinking aspects of mathematical modeling with the hot area of discrete optimization. It will be done in an academic handbook treatment outlining the state-of-the-art for researchers across the domains of the Computer Science, Math Programming, Applied Mathematics, Engineering, and Operations Research. Computer Science, and Combinatorics.

This book develops a new approach called parameter advising for finding a parameter setting for a sequence aligner that yields a quality alignment of a given set of input sequences. In this framework, a parameter advisor is a procedure that automatically chooses a parameter setting for the input, and has two main ingredients: (a) the set of parameter choices considered by the advisor, and (b) an estimator of alignment accuracy used to rank alignments produced by the aligner. On coupling a parameter advisor with an aligner, once the advisor is trained in a learning phase, the user simply inputs sequences to align, and receives an output alignment from the aligner, where the advisor has automatically selected the parameter setting. The chapters first lay out the foundations of parameter advising, and then cover applications and extensions of advising. The content * examines formulations of parameter advising and their computational complexity, * develops methods for learning good accuracy estimators, * presents approximation algorithms for finding good sets of parameter choices, and * assesses software implementations of advising that perform well on real biological data. Also explored are applications of parameter advising to * adaptive local realignment, where advising is performed on local regions of the sequences to automatically adapt to varying mutation rates, and * ensemble alignment, where advising is applied to an ensemble of aligners to effectively yield a new aligner of higher quality than the individual aligners in the ensemble. The book concludes by offering future directions in advising research.

In science, engineering and economics, decision problems are frequently modelled by optimizing the value of a (primary) objective function under stated feasibility constraints. In many cases of practical relevance, the optimization problem structure does not warrant the global optimality of local solutions; hence, it is natural to search for the globally best solution(s). Global Optimization in Action provides a comprehensive discussion of adaptive partition strategies to solve global optimization problems under very general structural requirements. A unified approach to numerous known algorithms makes possible straightforward generalizations and extensions, leading to efficient computer-based implementations. A considerable part of the book is devoted to applications, including some generic problems from numerical analysis, and several case studies in environmental systems analysis and management. The book is essentially self-contained and is based on the author's research, in cooperation (on applications) with a number of colleagues. Audience: Professors, students, researchers and other professionals in the fields of operations research, management science, industrial and applied mathematics, computer science, engineering, economics and the environmental sciences.

The book provides readers with a snapshot of the state of the art in the field of nature-inspired computing and its application in optimization. The approach is mainly practice-oriented: each bio-inspired technique or algorithm is introduced together with one of its possible applications. Applications cover a wide range of real-world optimization problems: from feature selection and image enhancement to scheduling and dynamic resource management, from wireless sensor networks and wiring network diagnosis to sports training planning and gene expression, from topology control and morphological filters to nutritional meal design and antenna array design. There are a few theoretical chapters comparing different existing techniques, exploring the advantages of nature-inspired computing over other methods, and investigating the mixing time of genetic algorithms. The book also introduces a wide range of algorithms, including the ant colony optimization, the bat algorithm, genetic algorithms, the collision-based optimization algorithm, the flower pollination algorithm, multi-agent systems and particle swarm optimization. This timely book is intended as a practice-oriented reference guide for students, researchers and professionals.

Semidefinite programming has been described as linear programming for the year 2000. It is an exciting new branch of mathematical programming, due to important applications in control theory, combinatorial optimization and other fields. Moreover, the successful interior point algorithms for linear programming can be extended to semidefinite programming.
In this monograph the basic theory of interior point algorithms is explained. This includes the latest results on the properties of the central path as well as the analysis of the most important classes of algorithms. Several "classic" applications of semidefinite programming are also described in detail. These include the Lov sz theta function and the MAX-CUT approximation algorithm by Goemans and Williamson.
Audience: Researchers or graduate students in optimization or related fields, who wish to learn more about the theory and applications of semidefinite programming.

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 is based on the papers presented at the International Conference 'Quality Improvement through Statistical Methods' in Cochin, India during December 28-31, 1996. The Conference was hosted by the Cochin University of Science and Technology, Cochin, India; and sponsored by the Institute for Improvement in Quality and Productivity (IIQP) at the University of Waterloo, Canada, the Statistics in Industry Committee of the International Statistical Institute (lSI) and by the Indian Statistical Institute. There has been an increased interest in Quality Improvement (QI) activities in many organizations during the last several years since the airing of the NBC television program, "If Japan can ... why can't we?" Implementation of QI meth ods requires statistical thinking and the utilization of statistical tools, thus there has been a renewed interest in statistical methods applicable to industry and technology. This revitalized enthusiasm has created worldwide discussions on Industrial Statistics Research and QI ideas at several international conferences in recent years. The purpose of this conference was to provide a forum for presenting and ex changing ideas in Statistical Methods and for enhancing the transference of such technologies to quality improvement efforts in various sectors. It also provided an opportunity for interaction between industrial practitioners and academia. It was intended that the exchange of experiences and ideas would foster new international collaborations in research and other technology transfers."

Global optimization concerns the computation and characterization of global optima of nonlinear functions. Such problems are widespread in the mathematical modelling of real systems in a very wide range of applications and the last 30 years have seen the development of many new theoretical, algorithmic and computational contributions which have helped to solve globally multiextreme problems in important practical applications. Most of the existing books on optimization focus on the problem of computing locally optimal solutions. Introduction to Global Optimization, however, is a comprehensive textbook on constrained global optimization that covers the fundamentals of the subject, presenting much new material, including algorithms, applications and complexity results for quadratic programming, concave minimization, DC and Lipschitz problems, and nonlinear network flow. Each chapter contains illustrative examples and ends with carefully selected exercises, designed to help students grasp the material and enhance their knowledge of the methods involved. Audience: Students of mathematical programming, and all scientists, from whatever discipline, who need global optimization methods in such diverse areas as economic modelling, fixed charges, finance, networks and transportation, databases, chip design, image processing, nuclear and mechanical design, chemical engineering design and control, molecular biology, and environmental engineering.

The first comprehensive account of the theory of mass transportation problems and its applications. In Volume I, the authors systematically develop the theory with emphasis on the Monge-Kantorovich mass transportation and the Kantorovich-Rubinstein mass transshipment problems. They then discuss a variety of different approaches towards solving these problems and exploit the rich interrelations to several mathematical sciences - from functional analysis to probability theory and mathematical economics. The second volume is devoted to applications of the above problems to topics in applied probability, theory of moments and distributions with given marginals, queuing theory, risk theory of probability metrics and its applications to various fields, among them general limit theorems for Gaussian and non-Gaussian limiting laws, stochastic differential equations and algorithms, and rounding problems. Useful to graduates and researchers in theoretical and applied probability, operations research, computer science, and mathematical economics, the prerequisites for this book are graduate level probability theory and real and functional analysis.

Classical probability theory provides information about random walks after a fixed number of steps. For applications, however, it is more natural to consider random walks evaluated after a random number of steps. Examples are sequential analysis, queuing theory, storage and inventory theory, insurance risk theory, reliability theory, and the theory of contours. Stopped Random Walks: Limit Theorems and Applications shows how this theory can be used to prove limit theorems for renewal counting processes, first passage time processes, and certain two-dimenstional random walks, and to how these results are useful in various applications.

This second edition offers updated content and an outlook on further results, extensions and generalizations. A new chapter examines nonlinear renewal processes in order to present the analagous theory for perturbed random walks, modeled as a random walk plus "noise."

Optimality Conditions in Convex Optimization explores an important and central issue in the field of convex optimization: optimality conditions. It brings together the most important and recent results in this area that have been scattered in the literature-notably in the area of convex analysis-essential in developing many of the important results in this book, and not usually found in conventional texts. Unlike other books on convex optimization, which usually discuss algorithms along with some basic theory, the sole focus of this book is on fundamental and advanced convex optimization theory. Although many results presented in the book can also be proved in infinite dimensions, the authors focus on finite dimensions to allow for much deeper results and a better understanding of the structures involved in a convex optimization problem. They address semi-infinite optimization problems; approximate solution concepts of convex optimization problems; and some classes of non-convex problems which can be studied using the tools of convex analysis. They include examples wherever needed, provide details of major results, and discuss proofs of the main results.

In this volume the author develops and applies methods for proving, from large cardinals, the determinacy of definable games of countable length on natural numbers. The determinacy is ultimately derived from iteration strategies, connecting games on natural numbers with the specific iteration games that come up in the study of large cardinals. The games considered in this text range in strength, from games of fixed countable length, through games where the length is clocked by natural numbers, to games in which a run is complete when its length is uncountable in an inner model (or a pointclass) relative to the run. More can be done using the methods developed here, reaching determinacy for games of certain length. The book is largely self-contained. Only graduate level knowledge of modern techniques in large cardinals and basic forcing is assumed. Several exercises allow the reader to build on the results in the text, for example connecting them with universally Baire and homogeneously Suslin sets. - Important contribution to one of the main features of current set theory, as initiated and developed by Jensen, Woodin, Steel and others.

Measurement plays a fundamental role both in physical and behavioral sciences, as well as in engineering and technology: it is the link between abstract models and empirical reality and is a privileged method of gathering information from the real world.

Is it possible to develop a single theory of measurement for the various domains of science and technology in which measurement is involved? This book takes the challenge by addressing the following main issues: What is the meaning of measurement? How do we measure? What can be measured?

A theoretical framework that could truly be shared by scientists in different fields, ranging from physics and engineering to psychology is developed. The future in fact will require greater collaboration between science and technology and between different sciences. Measurement, which played a key role in the birth of modern science, can act as an essential interdisciplinary tool and language for this new scenario.

A sound theoretical basis for addressing key problems in measurement is provided. These include perceptual measurement, the evaluation of uncertainty, the evaluation of inter-comparisons, the analysis of risks in decision-making and the characterization of dynamical measurement. Currently, increasing attention is paid to these issues due to their scientific, technical, economic and social impact. The book proposes a unified probabilistic approach to them which may allow more rational and effective solutions to be reached.

Great care was taken to make the text as accessible as possible in several ways. Firstly, by giving preference to as interdisciplinary a terminology as possible; secondly, by carefully defining and discussing all key terms. This ensures that a wide readership, including people from different mathematical backgrounds and different understandings of measurement can all benefit from this work. Concerning mathematics, all the main results are preceded by intuitive discussions and illustrated by simple examples. Moreover, precise proofs are always included in order to enable the more demanding readers to make conscious and creative use of these ideas, and also to develop new ones.

The book demonstrates that measurement, which is commonly understood to be a merely experimental matter, poses theoretical questions which are no less challenging than those arising in other, apparently more theoretical, disciplines.

Optimization is everywhere. It is human nature to seek the best option among all that are available. Nature, too, seems to be guided by optimization-many laws of nature have a variational character. Among geometric gures in the plane with a xed perimeter, the circle has the greatest area. Such isoperim- ric problems involving geometric gures date back to ancient Greece. Fermat's principle, discovered in 1629, stating that the tangent line is horizontal at a minimum point, seems to have in uenced the development of calculus. The proofs of Rolle's theorem and the mean value theorem in calculus use the Weierstrass theorem on the existence of maximizers and minimizers. The - troduction of the brachistochrone problem in 1696 by Johann Bernoulli had a tremendous impact on the development of the calculus of variations and in uenced the development of functional analysis. The variational character of laws of mechanics and optics were discovered in the seventeenth and ei- teenth centuries. Euler and Lagrange forged the foundations of the calculus of variations in the eighteenth century. In the nineteenth century, Riemann used Dirichlet's principle, which has a variational character, in his investigations in complex analysis. The simplex method for linear programming was disc- ered shortly after the advent of computers in the 1940s, and in uenced the subsequent development of mathematical programming. The emergence of the theory of optimal control in the 1950s was in response to the need for contr- ling space vehicles and various industrial processes.

The mathematical theory for many application areas depends on a deep understanding of the theory of moments. These areas include medical imaging, signal processing, computer visualization, and data science. The problem of moments has also found novel applications to areas such as control theory, image analysis, signal processing, polynomial optimization, and statistical big data. The Classical Moment Problem and Some Related Questions in Analysis presents: a unified treatment of the development of the classical moment problem from the late 19th century to the middle of the 20th century, important connections between the moment problem and many branches of analysis, a unified exposition of important classical results, which are difficult to read in the original journals, and a strong foundation for many areas in modern applied mathematics.

Nonlinear Assignment Problems (NAPs) are natural extensions of the classic Linear Assignment Problem, and despite the efforts of many researchers over the past three decades, they still remain some of the hardest combinatorial optimization problems to solve exactly. The purpose of this book is to provide in a single volume, major algorithmic aspects and applications of NAPs as contributed by leading international experts. The chapters included in this book are concerned with major applications and the latest algorithmic solution approaches for NAPs. Approximation algorithms, polyhedral methods, semidefinite programming approaches and heuristic procedures for NAPs are included, while applications of this problem class in the areas of multiple-target tracking in the context of military surveillance systems, of experimental high energy physics, and of parallel processing are presented. Audience: Researchers and graduate students in the areas of combinatorial optimization, mathematical programming, operations research, physics, and computer science.

This is the first book presenting a broad overview of parallelism in constraint-based reasoning formalisms. In recent years, an increasing number of contributions have been made on scaling constraint reasoning thanks to parallel architectures. The goal in this book is to overview these achievements in a concise way, assuming the reader is familiar with the classical, sequential background. It presents work demonstrating the use of multiple resources from single machine multi-core and GPU-based computations to very large scale distributed execution platforms up to 80,000 processing units. The contributions in the book cover the most important and recent contributions in parallel propositional satisfiability (SAT), maximum satisfiability (MaxSAT), quantified Boolean formulas (QBF), satisfiability modulo theory (SMT), theorem proving (TP), answer set programming (ASP), mixed integer linear programming (MILP), constraint programming (CP), stochastic local search (SLS), optimal path finding with A*, model checking for linear-time temporal logic (MC/LTL), binary decision diagrams (BDD), and model-based diagnosis (MBD). The book is suitable for researchers, graduate students, advanced undergraduates, and practitioners who wish to learn about the state of the art in parallel constraint reasoning.

This book on canonical duality theory provides a comprehensive review of its philosophical origin, physics foundation, and mathematical statements in both finite- and infinite-dimensional spaces. A ground-breaking methodological theory, canonical duality theory can be used for modeling complex systems within a unified framework and for solving a large class of challenging problems in multidisciplinary fields in engineering, mathematics, and the sciences. This volume places a particular emphasis on canonical duality theory's role in bridging the gap between non-convex analysis/mechanics and global optimization. With 18 total chapters written by experts in their fields, this volume provides a nonconventional theory for unified understanding of the fundamental difficulties in large deformation mechanics, bifurcation/chaos in nonlinear science, and the NP-hard problems in global optimization. Additionally, readers will find a unified methodology and powerful algorithms for solving challenging problems in complex systems with real-world applications in non-convex analysis, non-monotone variational inequalities, integer programming, topology optimization, post-buckling of large deformed structures, etc. Researchers and graduate students will find explanation and potential applications in multidisciplinary fields.

In recent years global optimization has found applications in many interesting areas of science and technology including molecular biology, chemical equilibrium problems, medical imaging and networks. The collection of papers in this book indicates the diverse applicability of global optimization. Furthermore, various algorithmic, theoretical developments and computational studies are presented. Audience: All researchers and students working in mathematical programming.

This book is the first to present in a systematic manner the application of game theory to fisheries management at both international and national levels. Strategic interaction among fishers and nations exploiting fishery resources is an inescapable fact of life. This has long been recognized at the international level, and is becoming increasingly recognized at the national/regional level. It follows, therefore, that, in order to be able to analyse effectively the management of these resources, the theory of strategic interaction game theory must be brought to bear. In this book the step-by-step development of the game theory is accompanied by numerous applications to the real world of fisheries management policy. As such, it is designed to appeal to policy makers and stakeholders, as well as to graduate students in Economics.

• Provides well-written self-contained chapters, including problem sets and exercises, making it ideal for the classroom setting;
• Introduces applied optimization to the hazardous waste blending problem;
• Explores linear programming, nonlinear programming, discrete optimization, global optimization, optimization under uncertainty, multi-objective optimization, optimal control and stochastic optimal control;
• Includes an extensive bibliography at the end of each chapter and an index;
• GAMS files of case studies for Chapters 2, 3, 4, 5, and 7 are linked to http: //www.springer.com/math/book/978-0-387-76634-8;

Solutions manual available upon adoptions.