This superb new book is one of the first publications in recent years to provide a broad overview of this interdisciplinary field. Most of the book is written in a self contained manner, assuming only a general knowledge of statistical mechanics and basic probabilty theory . It provides the reader with a sound introduction to the field and to the analytical techniques necessary to follow its most recent developments

This book deals with decision making in environments of significant data un certainty, with particular emphasis on operations and production management applications. For such environments, we suggest the use of the robustness ap proach to decision making, which assumes inadequate knowledge of the decision maker about the random state of nature and develops a decision that hedges against the worst contingency that may arise. The main motivating factors for a decision maker to use the robustness approach are: * It does not ignore uncertainty and takes a proactive step in response to the fact that forecasted values of uncertain parameters will not occur in most environments; * It applies to decisions of unique, non-repetitive nature, which are common in many fast and dynamically changing environments; * It accounts for the risk averse nature of decision makers; and * It recognizes that even though decision environments are fraught with data uncertainties, decisions are evaluated ex post with the realized data. For all of the above reasons, robust decisions are dear to the heart of opera tional decision makers. This book takes a giant first step in presenting decision support tools and solution methods for generating robust decisions in a variety of interesting application environments. Robust Discrete Optimization is a comprehensive mathematical programming framework for robust decision making.

This book demonstrates how to apply modern approaches to complex system control in practical applications involving knowledge-based systems. The dimensions of knowledge-based systems are extended by incorporating new perspectives from control theory, multimodal systems and simulation methods. The book is divided into three parts: theory, production system and information system applications. One of its main focuses is on an agent-based approach to complex system analysis. Moreover, specialised forms of knowledge-based systems (like e-learning, social network, and production systems) are introduced with a new formal approach to knowledge system modelling. The book, which offers a valuable resource for researchers engaged in complex system analysis, is the result of a unique cooperation between scientists from applied computer science (mainly from Poland) and leading system control theory researchers from the Russian Academy of Sciences' Trapeznikov Institute of Control Sciences.

Nonsmooth energy functions govern phenomena which occur frequently in nature and in all areas of life. They constitute a fascinating subject in mathematics and permit the rational understanding of yet unsolved or partially solved questions in mechanics, engineering and economics. This is the first book to provide a complete and rigorous presentation of the quasidifferentiability approach to nonconvex, possibly nonsmooth, energy functions, of the derivation and study of the corresponding variational expressions in mechanics, engineering and economics, and of their numerical treatment. The new variational formulations derived are illustrated by many interesting numerical problems. The techniques presented will permit the reader to check any solution obtained by other heuristic techniques for nonconvex, nonsmooth energy problems. A civil, mechanical or aeronautical engineer can find in the book the only existing mathematically sound technique for the formulation and study of nonconvex, nonsmooth energy problems. Audience: The book will be of interest to pure and applied mathematicians, physicists, researchers in mechanics, civil, mechanical and aeronautical engineers, structural analysts and software developers. It is also suitable for graduate courses in nonlinear mechanics, nonsmooth analysis, applied optimization, control, calculus of variations and computational mechanics.

Invexity and Optimization presents results on invex function and their properties in smooth and nonsmooth cases, pseudolinearity and eta-pseudolinearity. Results on optimality and duality for a nonlinear scalar programming problem are presented, second and higher order duality results are given for a nonlinear scalar programming problem, and saddle point results are also presented. Invexity in multiobjective programming problems and Kuhn-Tucker optimality conditions are given for a multiobjecive programming problem, Wolfe and Mond-Weir type dual models are given for a multiobjective programming problem and usual duality results are presented in presence of invex functions. Continuous-time multiobjective problems are also discussed. Quadratic and fractional programming problems are given for invex functions. Symmetric duality results are also given for scalar and vector cases.

The theory of Vector Optimization is developed by a systematic usage of infimum and supremum. In order to get existence and appropriate properties of the infimum, the image space of the vector optimization problem is embedded into a larger space, which is a subset of the power set, in fact, the space of self-infimal sets. Based on this idea we establish solution concepts, existence and duality results and algorithms for the linear case. The main advantage of this approach is the high degree of analogy to corresponding results of Scalar Optimization. The concepts and results are used to explain and to improve practically relevant algorithms for linear vector optimization problems.

With contributions by specialists in optimization and practitioners in the fields of aerospace engineering, chemical engineering, and fluid and solid mechanics, the major themes include an assessment of the state of the art in optimization algorithms as well as challenging applications in design and control, in the areas of process engineering and systems with partial differential equation models.

This is the second of three volumes surveying the state of the art in Game Theory and its applications to many and varied fields, in particular to economics. The chapters in the present volume are contributed by outstanding authorities, and provide comprehensive coverage and precise statements of the main results in each area. The applications include empirical evidence. The following topics are covered: communication and correlated equilibria, coalitional games and coalition structures, utility and subjective probability, common knowledge, bargaining, zero-sum games, differential games, and applications of game theory to signalling, moral hazard, search, evolutionary biology, international relations, voting procedures, social choice, public economics, politics, and cost allocation. This handbook will be of interest to scholars in economics, political science, psychology, mathematics and biology. For more information on the Handbooks in Economics series, please see our home page on http: //www.elsevier.nl/locate/hes

This book introduces methods for uncertain multi-attribute decision making including uncertain multi-attribute group decision making and their applications to supply chain management, investment decision making, personnel assessment, redesigning products, maintenance services, military system efficiency evaluation. Multi-attribute decision making, also known as multi-objective decision making with finite alternatives, is an important component of modern decision science. The theory and methods of multi-attribute decision making have been extensively applied in engineering, economics, management and military contexts, such as venture capital project evaluation, facility location, bidding, development ranking of industrial sectors and so on. Over the last few decades, great attention has been paid to research on multi-attribute decision making in uncertain settings, due to the increasing complexity and uncertainty of supposedly objective aspects and the fuzziness of human thought. This book can be used as a reference guide for researchers and practitioners working in e.g. the fields of operations research, information science, management science and engineering. It can also be used as a textbook for postgraduate and senior undergraduate students.

This book deals with combinatorial aspects of epistasis, a notion that existed for years in genetics and appeared in the ?eld of evolutionary algorithms in the early 1990s. Even thoughthe?rst chapterputsepistasisintheperspective ofevolutionary algorithms and arti?cial intelligence, and applications occasionally pop up in other chapters, thisbookisessentiallyaboutmathematics, aboutcombinatorialtechniques to compute in an e?cient and mathematically elegant way what will be de?ned as normalized epistasis. Some of the material in this book ?nds its origin in the PhD theses of Hugo Van Hove [97] and Dominique Suys [95]. The sixth chapter also contains material that appeared in the dissertation of Luk Schoofs [84]. Together with that of M. Teresa Iglesias [36], these dissertations form the backbone of a decade of mathematical ventures in the world of epistasis. The authors wish to acknowledge support from the Flemish Fund of Scienti?c - search (FWO-Vlaanderen) and of the Xunta de Galicia. They also wish to explicitly mentiontheintellectualandmoralsupporttheyreceivedthroughoutthepreparation of this work from their family and their colleagues Emilio Villanueva, Jose Mar'a Barja and Arnold Beckelheimer, as well as our local T T Xpert Jan Adriaenssens.

In some domains of mechanics, physics and control theory boundary value problems arise for nonlinear first order PDEs. A well-known classical result states a sufficiency condition for local existence and uniqueness of twice differentiable solution. This result is based on the method of characteristics (MC). Very often, and as a rule in control theory, the continuous nonsmooth (non-differentiable) functions have to be treated as a solutions to the PDE. At the points of smoothness such solutions satisfy the equation in classical sense. But if a function satisfies this condition only, with no requirements at the points of nonsmoothness, the PDE may have nonunique solutions. The uniqueness takes place if an appropriate matching principle for smooth solution branches defined in neighboring domains is applied or, in other words, the notion of generalized solution is considered. In each field an appropriate matching principle are used. In Optimal Control and Differential Games this principle is the optimality of the cost function. In physics and mechanics certain laws must be fulfilled for correct matching. A purely mathematical approach also can be used, when the generalized solution is introduced to obtain the existence and uniqueness of the solution, without being aimed to describe (to model) some particular physical phenomenon. Some formulations of the generalized solution may meet the modelling of a given phenomenon, the others may not.

In 1984, N. Karmarkar published a seminal paper on algorithmic linear programming. During the subsequent decade, it stimulated a huge outpouring of new algorithmic results by researchers world-wide in many areas of mathematical programming and numerical computation. This book gives an overview of the resulting, dramatic reorganization that has occurred in one of these areas: algorithmic differentiable optimization and equation-solving, or, more simply, algorithmic differentiable programming. The book is aimed at readers familiar with advanced calculus, numerical analysis, in particular numerical linear algebra, the theory and algorithms of linear and nonlinear programming, and the fundamentals of computer science, in particular, computer programming and the basic models of computation and complexity theory. J.L. Nazareth is a Professor in the Department of Pure and Applied Mathematics at Washington State University. He is the author of two books previously published by Springer-Verlag, DLP and Extensions: An Optimization Model and Decision Support System (2001) and The Newton-Cauchy Framework: A Unified Approach to Unconstrained Nonlinear Minimization (1994).

This book presents a new optimization flow for quantum circuits realization. At the reversible level, optimization algorithms are presented to reduce the quantum cost. Then, new mapping approaches to decompose reversible circuits to quantum circuits using different quantum libraries are described. Finally, optimization techniques to reduce the quantum cost or the delay are applied to the resulting quantum circuits. Furthermore, this book studies the complexity of reversible circuits and quantum circuits from a theoretical perspective.

In the area of dynamic economics, David Cass 's work has spawned a number of important lines of research, including the study of dynamic general equilibrium theory, the concept of sunspot equilibria, and general equilibrium theory when markets are incomplete. Based on these contributions, this volume contains new developments in the field, written by Cass's students and co-authors.

Many advances have recently been made in metaheuristic methods, from theory to applications. The editors, both leading experts in this field, have assembled a team of researchers to contribute 21 chapters organized into parts on simulated annealing, tabu search, ant colony algorithms, general purpose studies of evolutionary algorithms, applications of evolutionary algorithms, and metaheuristics.

Recent years have witnessed a surge of activity in the field of dynamic both theory and applications. Theoretical as well as practical games, in problems in zero-sum and nonzero-sum games, continuous time differential and discrete time multistage games, and deterministic and stochastic games games are currently being investigated by researchers in diverse disciplines, such as engineering, mathematics, biology, economics, management science, and political science. This surge of interest has led to the formation of the International Society of Dynamic Games (ISDG) in 1990, whose primary goal is to foster the development of advanced research and applications in the field of game theory. One important activity of the Society is to organize biannually an international symposium which aims at bringing together all those who contribute to the development of this active field of applied science. In 1992 the symposium was organized in Grimentz, Switzerland, under the supervision of an international scientific committee and with the help of a local organizing committee based at University of Geneva. This book, which is the first volume in the new Series, Annals of the International Society of Dynamic Games (see the Preface to the Series), is based on presentations made at this symposium. It is however more than a book of proceedings for a conference. Every paper published in this volume has passed through a very selective refereeing process, as in an archival technical journal.

Potential Function Methods For Approximately Solving Linear Programming Problems breaks new ground in linear programming theory. The book draws on the research developments in three broad areas: linear and integer programming, numerical analysis, and the computational architectures which enable speedy, high-level algorithm design. During the last ten years, a new body of research within the field of optimization research has emerged, which seeks to develop good approximation algorithms for classes of linear programming problems. This work both has roots in fundamental areas of mathematical programming and is also framed in the context of the modern theory of algorithms. The result of this work, in which Daniel Bienstock has been very much involved, has been a family of algorithms with solid theoretical foundations and with growing experimental success. This book will examine these algorithms, starting with some of the very earliest examples, and through the latest theoretical and computational developments.

Extending the well-known connection between classical linear potential theory and probability theory (through the interplay between harmonic functions and martingales) to the nonlinear case of tug-of-war games and their related partial differential equations, this unique book collects several results in this direction and puts them in an elementary perspective in a lucid and self-contained fashion.

Modern option pricing theory was developed in the late sixties and early seventies by F. Black, R. e. Merton and M. Scholes as an analytical tool for pricing and hedging option contracts and over-the-counter warrants. How ever, already in the seminal paper by Black and Scholes, the applicability of the model was regarded as much broader. In the second part of their paper, the authors demonstrated that a levered firm's equity can be regarded as an option on the value of the firm, and thus can be priced by option valuation techniques. A year later, Merton showed how the default risk structure of cor porate bonds can be determined by option pricing techniques. Option pricing models are now used to price virtually the full range of financial instruments and financial guarantees such as deposit insurance and collateral, and to quantify the associated risks. Over the years, option pricing has evolved from a set of specific models to a general analytical framework for analyzing the production process of financial contracts and their function in the financial intermediation process in a continuous time framework. However, very few attempts have been made in the literature to integrate game theory aspects, i. e. strategic financial decisions of the agents, into the continuous time framework. This is the unique contribution of the thesis of Dr. Alexandre Ziegler. Benefiting from the analytical tractability of contin uous time models and the closed form valuation models for derivatives, Dr."

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.

The volume, devoted to variational analysis and its applications, collects selected and refereed contributions, which provide an outline of the field. The meeting of the title "Equilibrium Problems and Variational Models," which was held in Erice (Sicily) in the period June 23 - July 2 2000, was the occasion of the presentation of some of these papers; other results are a consequence of a fruitful and constructive atmosphere created during the meeting. New results, which enlarge the field of application of variational analysis, are presented in the book; they deal with the vectorial analysis, time dependent variational analysis, exact penalization, high order deriva tives, geometric aspects, distance functions and log-quadratic proximal methodology. The new theoretical results allow one to improve in a remarkable way the study of significant problems arising from the applied sciences, as continuum model of transportation, unilateral problems, multicriteria spatial price models, network equilibrium problems and many others. As noted in the previous book "Equilibrium Problems: Nonsmooth Optimization and Variational Inequality Models," edited by F. Giannessi, A. Maugeri and P.M. Pardalos, Kluwer Academic Publishers, Vol. 58 (2001), the progress obtained by variational analysis has permitted to han dle problems whose equilibrium conditions are not obtained by the mini mization of a functional. These problems obey a more realistic equilibrium condition expressed by a generalized orthogonality (complementarity) con dition, which enriches our knowledge of the equilibrium behaviour. Also this volume presents important examples of this formulation."

This book presents two natural generalizations of continuous mappings, namely usco and quasicontinuous mappings. The first class considers set-valued mappings, the second class relaxes the definition of continuity. Both these topological concepts stem naturally from basic mathematical considerations and have numerous applications that are covered in detail.

There has been much recent progress in approximation algorithms for nonconvex continuous and discrete problems from both a theoretical and a practical perspective. In discrete (or combinatorial) optimization many approaches have been developed recently that link the discrete universe to the continuous universe through geomet ric, analytic, and algebraic techniques. Such techniques include global optimization formulations, semidefinite programming, and spectral theory. As a result new ap proximate algorithms have been discovered and many new computational approaches have been developed. Similarly, for many continuous nonconvex optimization prob lems, new approximate algorithms have been developed based on semidefinite pro gramming and new randomization techniques. On the other hand, computational complexity, originating from the interactions between computer science and numeri cal optimization, is one of the major theories that have revolutionized the approach to solving optimization problems and to analyzing their intrinsic difficulty. The main focus of complexity is the study of whether existing algorithms are efficient for the solution of problems, and which problems are likely to be tractable. The quest for developing efficient algorithms leads also to elegant general approaches for solving optimization problems, and reveals surprising connections among problems and their solutions. A conference on Approximation and Complexity in Numerical Optimization: Con tinuous and Discrete Problems was held during February 28 to March 2, 1999 at the Center for Applied Optimization of the University of Florida."