Game Theory has been an area of rapid growth and substantial interest in economics and it has impacted upon all areas within economics. This text covers the main theory and techniques and gives particular emphasis to aspects that have been neglected, including co-operative games, experiments, and empirical studies. It provides a comprehensive and up-to-date introduction to the use of game theory in economics.

This text is comprised of selected research articles developed from a workshop on Ergodic Theory, Probabilistic Methods and Applications, held in April 2012 at the Banff International Research Station. It contains contributions from world leading experts in ergodic theory, numerical dynamical systems, molecular dynamics and ocean/atmosphere dynamics, nonequilibrium statistical mechanics. The volume will serve as a valuable reference for mathematicians, physicists, engineers, biologists and climate scientists, who currently use, or wish to learn how to use, probabilistic techniques to cope with dynamical models that display open or non-equilibrium behaviour.

This book presents a mathematically-based introduction into the fascinating topic of Fuzzy Sets and Fuzzy Logic and might be used as textbook at both undergraduate and graduate levels and also as reference guide for mathematician, scientists or engineers who would like to get an insight into Fuzzy Logic.

Fuzzy Sets have been introduced by Lotfi Zadeh in 1965 and since then, they have been used in many applications. As a consequence, there is a vast literature on the practical applications of fuzzy sets, while theory has a more modest coverage. The main purpose of the present book is to reduce this gap by providing a theoretical introduction into Fuzzy Sets based on Mathematical Analysis and Approximation Theory. Well-known applications, as for example fuzzy control, are also discussed in this book and placed on new ground, a theoretical foundation. Moreover, a few advanced chapters and several new results are included. These comprise, among others, a new systematic and constructive approach for fuzzy inference systems of Mamdani and Takagi-Sugeno types, that investigates their approximation capability by providing new error estimates.

"

In 1995 the Handbook of Global Optimization (first volume), edited by R. Horst, and P.M. Pardalos, was published. This second volume of the Handbook of Global Optimization is comprised of chapters dealing with modern approaches to global optimization, including different types of heuristics.

Topics covered in the handbook include various metaheuristics, such as simulated annealing, genetic algorithms, neural networks, taboo search, shake-and-bake methods, and deformation methods. In addition, the book contains chapters on new exact stochastic and deterministic approaches to continuous and mixed-integer global optimization, such as stochastic adaptive search, two-phase methods, branch-and-bound methods with new relaxation and branching strategies, algorithms based on local optimization, and dynamical search. Finally, the book contains chapters on experimental analysis of algorithms and software, test problems, and applications.

A state-of-the-art research monograph providing consistent treatment of supervisory control, by one of the world 's leading groups in the area of Bayesian identification, control, and decision making. An accompanying CD illustrates the book 's underlying theory.

Linear Programming (LP) is perhaps the most frequently used optimization technique. One of the reasons for its wide use is that very powerful solution algorithms exist for linear optimization. Computer programs based on either the simplex or interior point methods are capable of solving very large-scale problems with high reliability and within reasonable time. Model builders are aware of this and often try to formulate real-life problems within this framework to ensure they can be solved efficiently. It is also true that many real-life optimization problems can be formulated as truly linear models and also many others can well be approximated by linearization. The two main methods for solving LP problems are the variants of the simplex method and the interior point methods (IPMs). It turns out that both variants have their role in solving different problems. It has been recognized that, since the introduction of the IPMs, the efficiency of simplex based solvers has increased by two orders of magnitude. This increased efficiency can be attributed to the following: (1) theoretical developments in the underlying algorithms, (2) inclusion of results of computer science, (3) using the principles of software engineering, and (4) taking into account the state-of-the-art in computer technology.
Theoretically correct algorithms can be implemented in many different ways, but the performance is dependent on how the implementation is done. The success is based on the proper synthesis of the above mentioned (1-4) components. Computational Techniques of the Simplex Method is a systematic treatment focused on the computational issues of the simplex method. It provides a comprehensive coverage of the most important and successful algorithmic and implementation techniques of the simplex method. It is a unique source of essential, never discussed details of algorithmic elements and their implementation. On the basis of the book the reader will be able to create a highly advanced implementation of the simplex method which, in turn, can be used directly or as a building block in other solution algorithms.

Optimization problems abound in most fields of science, engineering, and tech nology. In many of these problems it is necessary to compute the global optimum (or a good approximation) of a multivariable function. The variables that define the function to be optimized can be continuous and/or discrete and, in addition, many times satisfy certain constraints. Global optimization problems belong to the complexity class of NP-hard prob lems. Such problems are very difficult to solve. Traditional descent optimization algorithms based on local information are not adequate for solving these problems. In most cases of practical interest the number of local optima increases, on the aver age, exponentially with the size of the problem (number of variables). Furthermore, most of the traditional approaches fail to escape from a local optimum in order to continue the search for the global solution. Global optimization has received a lot of attention in the past ten years, due to the success of new algorithms for solving large classes of problems from diverse areas such as engineering design and control, computational chemistry and biology, structural optimization, computer science, operations research, and economics. This book contains refereed invited papers presented at the conference on "State of the Art in Global Optimization: Computational Methods and Applications" held at Princeton University, April 28-30, 1995. The conference presented current re search on global optimization and related applications in science and engineering. The papers included in this book cover a wide spectrum of approaches for solving global optimization problems and applications."

This book is an up-to-date documentation of the state of the art in combinatorial optimization, presenting approximate solutions of virtually all relevant classes of NP-hard optimization problems. The well-structured wealth of problems, algorithms, results, and techniques introduced systematically will make the book an indispensible source of reference for professionals. The smooth integration of numerous illustrations, examples, and exercises make this monograph an ideal textbook.

The volume is dedicated to Stephen Smale on the occasion of his 80th birthday.Besides his startling 1960 result of the proof of the Poincare conjecture for all dimensionsgreater than or equal to five, Smale's ground breaking contributions invarious fields in Mathematics have marked the second part of the 20th century andbeyond. Stephen Smale has done pioneering work in differential topology, globalanalysis, dynamical systems, nonlinear functional analysis, numerical analysis, theoryof computation and machine learning as well as applications in the physical andbiological sciences and economics. In sum, Stephen Smale has manifestly brokenthe barriers among the different fields of mathematics and dispelled some remainingprejudices. He is indeed a universal mathematician. Smale has been honoredwith several prizes and honorary degrees including, among others, the Fields Medal(1966), The Veblen Prize (1966), the National Medal of Science (1996) and theWolfPrize (2006/2007)."

This book includes a collection of research articles presented at the "6th International Workshop on Hydro Scheduling in Competitive Electricity Markets". The workshop was a unique and intimate forum for researchers and practitioners to present state-of-the-art research and development concerning novel methodological findings, best practices and real-life applications of hydro scheduling. It also provided a platform for discussing the developments that are taking place in the industry, sharing different experiences and discussing future trends related to this area. This proceedings book is a collection of the most relevant, high-quality articles from the workshop. Discussing the state-of-the-art in the field of hydro scheduling, it is a valuable resource for a wide audience of researchers and practitioners in the field now and in the interesting and challenging times ahead.

Interest in constrained optimization originated with the simple linear pro gramming model since it was practical and perhaps the only computationally tractable model at the time. Constrained linear optimization models were soon adopted in numerous application areas and are perhaps the most widely used mathematical models in operations research and management science at the time of this writing. Modelers have, however, found the assumption of linearity to be overly restrictive in expressing the real-world phenomena and problems in economics, finance, business, communication, engineering design, computational biology, and other areas that frequently demand the use of nonlinear expressions and discrete variables in optimization models. Both of these extensions of the linear programming model are NP-hard, thus representing very challenging problems. On the brighter side, recent advances in algorithmic and computing technology make it possible to re visit these problems with the hope of solving practically relevant problems in reasonable amounts of computational time. Initial attempts at solving nonlinear programs concentrated on the de velopment of local optimization methods guaranteeing globality under the assumption of convexity. On the other hand, the integer programming liter ature has concentrated on the development of methods that ensure global optima. The aim of this book is to marry the advancements in solving nonlinear and integer programming models and to develop new results in the more general framework of mixed-integer nonlinear programs (MINLPs) with the goal of devising practically efficient global optimization algorithms for MINLPs."

Functional analysis owes much of its early impetus to problems that arise in the calculus of variations. In turn, the methods developed there have been applied to optimal control, an area that also requires new tools, such as nonsmooth analysis. This self-contained textbook gives a complete course on all these topics. It is written by a leading specialist who is also a noted expositor. This book provides a thorough introduction to functional analysis and includes many novel elements as well as the standard topics. A short course on nonsmooth analysis and geometry completes the first half of the book whilst the second half concerns the calculus of variations and optimal control. The author provides a comprehensive course on these subjects, from their inception through to the present. A notable feature is the inclusion of recent, unifying developments on regularity, multiplier rules, and the Pontryagin maximum principle, which appear here for the first time in a textbook. Other major themes include existence and Hamilton-Jacobi methods. The many substantial examples, and the more than three hundred exercises, treat such topics as viscosity solutions, nonsmooth Lagrangians, the logarithmic Sobolev inequality, periodic trajectories, and systems theory. They also touch lightly upon several fields of application: mechanics, economics, resources, finance, control engineering. Functional Analysis, Calculus of Variations and Optimal Control is intended to support several different courses at the first-year or second-year graduate level, on functional analysis, on the calculus of variations and optimal control, or on some combination. For this reason, it has been organized with customization in mind. The text also has considerable value as a reference. Besides its advanced results in the calculus of variations and optimal control, its polished presentation of certain other topics (for example convex analysis, measurable selections, metric regularity, and nonsmooth analysis) will be appreciated by researchers in these and related fields.

Bilevel programming problems are hierarchical optimization problems where the constraints of one problem (the so-called upper level problem) are defined in part by a second parametric optimization problem (the lower level problem). If the lower level problem has a unique optimal solution for all parameter values, this problem is equivalent to a one-level optimization problem having an implicitly defined objective function. Special emphasize in the book is on problems having non-unique lower level optimal solutions, the optimistic (or weak) and the pessimistic (or strong) approaches are discussed. The book starts with the required results in parametric nonlinear optimization. This is followed by the main theoretical results including necessary and sufficient optimality conditions and solution algorithms for bilevel problems. Stationarity conditions can be applied to the lower level problem to transform the optimistic bilevel programming problem into a one-level problem. Properties of the resulting problem are highlighted and its relation to the bilevel problem is investigated. Stability properties, numerical complexity, and problems having additional integrality conditions on the variables are also discussed. Audience: Applied mathematicians and economists working in optimization, operations research, and economic modelling. Students interested in optimization will also find this book useful.

Computer Science and Operations Research continue to have a synergistic relationship and this book represents the results of the cross-fertilization between OR/MS and CS/AI. It is this interface of OR/CS that makes possible advances that could not have been achieved in isolation. Taken collectively, these articles are indicative of the state of the art in the interface between OR/MS and CS/AI and of the high-caliber research being conducted by members of the INFORMS Computing Society.

This volume contains, in part, a selection of papers presented at the sixth Australian Optimization Day Miniconference (Ballarat, 16 July 1999), and the Special Sessions on Nonlinear Dynamics and Optimization and Operations Re search - Methods and Applications, which were held in Melbourne, July 11-15 1999 as a part of the Joint Meeting of the American Mathematical Society and Australian Mathematical Society. The editors have strived to present both con tributed papers and survey style papers as a more interesting mix for readers. Some participants from the meetings mentioned above have responded to this approach by preparing survey and 'semi-survey' papers, based on presented lectures. Contributed paper, which contain new and interesting results, are also included. The fields of the presented papers are very large as demonstrated by the following selection of key words from selected papers in this volume: * optimal control, stochastic optimal control, MATLAB, economic models, implicit constraints, Bellman principle, Markov process, decision-making under uncertainty, risk aversion, dynamic programming, optimal value function. * emergent computation, complexity, traveling salesman problem, signal estimation, neural networks, time congestion, teletraffic. * gap functions, nonsmooth variational inequalities, derivative-free algo rithm, Newton's method. * auxiliary function, generalized penalty function, modified Lagrange func tion. * convexity, quasiconvexity, abstract convexity.

This book offers a comprehensive treatment of linear programming as well as of the optimization of linear functions over polyhedra in finite dimensional Euclidean vector spaces. An introduction surveying fifty years of linear optimization is given. The book can serve both as a graduate textbook for linear programming and as a text for advanced topics classes or seminars. Exercises as well as several case studies are included. The book is based on the author's long term experience in teaching and research. For his research work he has received, among other honors, the 1983 Lanchester Prize of the Operations Research Society of America, the 1985 Dantzig Prize of the Mathematical Programming Society and the Society for Industrial Applied Mathematics and a 1989 Alexander-von-Humboldt Senior U.S. Scientist Research Award.

This book provides an introduction to the applications of game theory to a series of questions that are fundamental in political economy. These questions include: Why do we need states? What might happen without protection for life and property? How might tribes or criminal gangs behave in struggles over material possessions? Would people tell the truth if asked what they wanted?

Although the monograph Progress in Optimization I: Contributions from Aus tralasia grew from the idea of publishing a proceedings of the Fourth Optimiza tion Day, held in July 1997 at the Royal Melbourne Institute of Technology, the focus soon changed to a refereed volume in optimization. The intention is to publish a similar book annually, following each Optimization Day. The idea of having an annual Optimization Day was conceived by Barney Glover; the first of these Optimization Days was held in 1994 at the University of Ballarat. Barney hoped that such a yearly event would bring together the many, but widely dispersed, researchers in Australia who were publishing in optimization and related areas such as control. The first Optimization Day event was followed by similar conferences at The University of New South Wales (1995), The University of Melbourne (1996), the Royal Melbourne Institute of Technology (1997), and The University of Western Australia (1998). The 1999 conference will return to Ballarat University, being organized by Barney's long-time collaborator Alex Rubinov. In recent years the Optimization Day has been held in conjunction with other locally-held national or international conferences. This has widened the scope of the monograph with contributions not only coming from researchers in Australia and neighboring regions but also from their collaborators in Europe and North America."

A pioneering look at the fundamental role of logic in optimization and constraint satisfaction

While recent efforts to combine optimization and constraint satisfaction have received considerable attention, little has been said about using logic in optimization as the key to unifying the two fields. Logic-Based Methods for Optimization develops for the first time a comprehensive conceptual framework for integrating optimization and constraint satisfaction, then goes a step further and shows how extending logical inference to optimization allows for more powerful as well as flexible modeling and solution techniques. Designed to be easily accessible to industry professionals and academics in both operations research and artificial intelligence, the book provides a wealth of examples as well as elegant techniques and modeling frameworks ready for implementation. Timely, original, and thought-provoking, Logic-Based Methods for Optimization:

• Demonstrates the advantages of combining the techniques in problem solving
• Offers tutorials in constraint satisfaction/constraint programming and logical inference
• Clearly explains such concepts as relaxation, cutting planes, nonserial dynamic programming, and Bender’s decomposition
• Reviews the necessary technologies for software developers seeking to combine the two techniques
• Features extensive references to important computational studies
• And much more

This introductory textbook adopts a practical and intuitive approach, rather than emphasizing mathematical rigor. Computationally oriented books in this area generally present algorithms alone, and expect readers to perform computations by hand, and are often written in traditional computer languages, such as Basic, Fortran or Pascal. This book, on the other hand, is the first text to use Mathematica to develop a thorough understanding of optimization algorithms, fully exploiting Mathematica's symbolic, numerical and graphic capabilities.

This second edition of "A Beginner's Guide to Finite Mathematics" takes a distinctly applied approach to finite mathematics at the freshman and sophomore level. Topics are presented sequentially: the book opens with a brief review of sets and numbers, followed by an introduction to data sets, histograms, means and medians. Counting techniques and the Binomial Theorem are covered, which provides the foundation for elementary probability theory; this, in turn, leads to basic statistics. This new edition includes chapters on game theory and financial mathematics. Requiring little mathematical background beyond high school algebra, the text will be especially useful for business and liberal arts majors.

This book introduces a holistic approach to ship design and its optimisation for life-cycle operation. It deals with the scientific background of the adopted approach and the associated synthesis model, which follows modern computer aided engineering (CAE) procedures. It integrates techno-economic databases, calculation and multi-objective optimisation modules and s/w tools with a well-established Computer-Aided Design (CAD) platform, along with a Virtual Vessel Framework (VVF), which will allow virtual testing before the building phase of a new vessel. The resulting graphic user interface (GUI) and information exchange systems enable the exploration of the huge design space to a much larger extent and in less time than is currently possible, thus leading to new insights and promising new design alternatives. The book not only covers the various stages of the design of the main ship system, but also addresses relevant major onboard systems/components in terms of life-cycle performance to offer readers a better understanding of suitable outfitting details, which is a key aspect when it comes the outfitting-intensive products of international shipyards. The book disseminates results of the EU funded Horizon 2020 project HOLISHIP.

Economists can use computer algebra systems to manipulate symbolic models, derive numerical computations, and analyze empirical relationships among variables. Maxima is an open-source multi-platform computer algebra system that rivals proprietary software. Maxima's symbolic and computational capabilities enable economists and financial analysts to develop a deeper understanding of models by allowing them to explore the implications of differences in parameter values, providing numerical solutions to problems that would be otherwise intractable, and by providing graphical representations that can guide analysis. This book provides a step-by-step tutorial for using this program to examine the economic relationships that form the core of microeconomics in a way that complements traditional modeling techniques. Readers learn how to phrase the relevant analysis and how symbolic expressions, numerical computations, and graphical representations can be used to learn from microeconomic models. In particular, comparative statics analysis is facilitated. Little has been published on Maxima and its applications in economics and finance, and this volume will appeal to advanced undergraduates, graduate-level students studying microeconomics, academic researchers in economics and finance, economists, and financial analysts.

Focused on efficient simulation-driven multi-fidelity optimization techniques, this monograph on simulation-driven optimization covers simulations utilizing physics-based low-fidelity models, often based on coarse-discretization simulations or other types of simplified physics representations, such as analytical models. The methods presented in the book exploit as much as possible any knowledge about the system or device of interest embedded in the low-fidelity model with the purpose of reducing the computational overhead of the design process. Most of the techniques described in the book are of response correction type and can be split into parametric (usually based on analytical formulas) and non-parametric, i.e., not based on analytical formulas. The latter, while more complex in implementation, tend to be more efficient. The book presents a general formulation of response correction techniques as well as a number of specific methods, including those based on correcting the low-fidelity model response (output space mapping, manifold mapping, adaptive response correction and shape-preserving response prediction), as well as on suitable modification of design specifications. Detailed formulations, application examples and the discussion of advantages and disadvantages of these techniques are also included. The book demonstrates the use of the discussed techniques for solving real-world engineering design problems, including applications in microwave engineering, antenna design, and aero/hydrodynamics.

Lagrange and penalty function methods provide a powerful approach, both as a theoretical tool and a computational vehicle, for the study of constrained optimization problems. However, for a nonconvex constrained optimization problem, the classical Lagrange primal-dual method may fail to find a mini mum as a zero duality gap is not always guaranteed. A large penalty parameter is, in general, required for classical quadratic penalty functions in order that minima of penalty problems are a good approximation to those of the original constrained optimization problems. It is well-known that penaity functions with too large parameters cause an obstacle for numerical implementation. Thus the question arises how to generalize classical Lagrange and penalty functions, in order to obtain an appropriate scheme for reducing constrained optimiza tion problems to unconstrained ones that will be suitable for sufficiently broad classes of optimization problems from both the theoretical and computational viewpoints. Some approaches for such a scheme are studied in this book. One of them is as follows: an unconstrained problem is constructed, where the objective function is a convolution of the objective and constraint functions of the original problem. While a linear convolution leads to a classical Lagrange function, different kinds of nonlinear convolutions lead to interesting generalizations. We shall call functions that appear as a convolution of the objective function and the constraint functions, Lagrange-type functions."