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.

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 comprehensive introduction to design sensitivity analysis theory as applied to electromagnetic systems. It treats the subject in a unified manner, providing numerical methods and design examples. The specific focus is on continuum design sensitivity analysis, which offers significant advantages over discrete design sensitivity methods. Continuum design sensitivity formulas are derived from the material derivative in continuum mechanics and the variational form of the governing equation. Continuum sensitivity analysis is applied to Maxwell equations of electrostatic, magnetostatic and eddy-current systems, and then the sensitivity formulas for each system are derived in a closed form; an integration along the design interface. The book also introduces the recent breakthrough of the topology optimization method, which is accomplished by coupling the level set method and continuum design sensitivity. This topology optimization method enhances the possibility of the global minimum with minimised computational time, and in addition the evolving shapes during the iterative design process are easily captured in the level set equation. Moreover, since the optimization algorithm is transformed into a well-known transient analysis algorithm for differential equations, its numerical implementation becomes very simple and convenient. Despite the complex derivation processes and mathematical expressions, the obtained sensitivity formulas are very straightforward for numerical implementation. This book provides detailed explanation of the background theory and the derivation process, which will help readers understand the design method and will set the foundation for advanced research in the future.

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.

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.

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.

Optimization is a serious issue, touching many aspects of our life and activity. But it has not yet been completely absorbed in our culture. In this book the authors point out how relatively young even the word "model" is. On top of that, the concept is rather elusive. How to deal with a technology that ?nds applicationsinthingsasdi?erentaslogistics,robotics,circuitlayout,?nancial deals and tra?c control? Although, during the last decades, we made signi?cant progress, the broad public remained largely unaware of that. The days of John von Neumann, with his vast halls full of people frantically working mechanical calculators are long gone. Things that looked completely impossible in my youth, like solving mixed integer problems are routine by now. All that was not just achieved by ever faster and cheaper computers, but also by serious progress in mathematics. But even in a world that more and more understands that it cannot a?ord to waste resources, optimization remains to a large extent unknown. R It is quite logical and also fortunate that SAP , the leading supplier of enterprise management systems has embedded an optimizer in his software. The authors have very carefully investigated the capabilities and the limits of APO. Remember that optimization is still a work in progress. We do not have the tool that does everything for everybody.

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

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

Semi-infinite optimization is a vivid field of active research. Recently semi infinite optimization in a general form has attracted a lot of attention, not only because of its surprising structural aspects, but also due to the large number of applications which can be formulated as general semi-infinite programs. The aim of this book is to highlight structural aspects of general semi-infinite programming, to formulate optimality conditions which take this structure into account, and to give a conceptually new solution method. In fact, under certain assumptions general semi-infinite programs can be solved efficiently when their bi-Ievel structure is exploited appropriately. After a brief introduction with some historical background in Chapter 1 we be gin our presentation by a motivation for the appearance of standard and general semi-infinite optimization problems in applications. Chapter 2 lists a number of problems from engineering and economics which give rise to semi-infinite models, including (reverse) Chebyshev approximation, minimax problems, ro bust optimization, design centering, defect minimization problems for operator equations, and disjunctive programming."

Numerical methods in finance have emerged as a vital field at the crossroads of probability theory, finance and numerical analysis. Based on presentations given at the workshop Numerical Methods in Finance held at the INRIA Bordeaux (France) on June 1-2, 2010, this book provides an overview of the major new advances in the numerical treatment of instruments with American exercises. Naturally it covers the most recent research on the mathematical theory and the practical applications of optimal stopping problems as they relate to financial applications. By extension, it also provides an original treatment of Monte Carlo methods for the recursive computation of conditional expectations and solutions of BSDEs and generalized multiple optimal stopping problems and their applications to the valuation of energy derivatives and assets. The articles were carefully written in a pedagogical style and a reasonably self-contained manner. The book is geared toward quantitative analysts, probabilists, and applied mathematicians interested in financial applications.

In this edition, the scope and character of the monograph did not change with respect to the first edition. Taking into account the rapid development of the field, we have, however, considerably enlarged its contents. Chapter 4 includes two additional sections 4.4 and 4.6 on theory and algorithms of D.C. Programming. Chapter 7, on Decomposition Algorithms in Nonconvex Optimization, is completely new. Besides this, we added several exercises and corrected errors and misprints in the first edition. We are grateful for valuable suggestions and comments that we received from several colleagues. R. Horst, P.M. Pardalos and N.V. Thoai March 2000 Preface to the First Edition Many recent advances in science, economics and engineering rely on nu merical techniques for computing globally optimal solutions to corresponding optimization problems. Global optimization problems are extraordinarily di verse and they include economic modeling, fixed charges, finance, networks and transportation, databases and chip design, image processing, nuclear and mechanical design, chemical engineering design and control, molecular biology, and environment al engineering. Due to the existence of multiple local optima that differ from the global solution all these problems cannot be solved by classical nonlinear programming techniques. During the past three decades, however, many new theoretical, algorith mic, and computational contributions have helped to solve globally multi extreme problems arising from important practical applications."

Complementarity theory is a new domain in applied mathematics and is concerned with the study of complementarity problems. These problems represent a wide class of mathematical models related to optimization, game theory, economic engineering, mechanics, fluid mechanics, stochastic optimal control etc. The book is dedicated to the study of nonlinear complementarity problems by topological methods. Audience: Mathematicians, engineers, economists, specialists working in operations research and anybody interested in applied mathematics or in mathematical modeling.

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.

Most books about global optimization describe the theory of thealgorithms, whereas a given implementation's quality never dependsexclusively on the theoretical soundness of the algorithms that areimplemented. The literature rarely discusses the tuning of algorithmicparameters, implementation tricks, software architectures, and theembedding of local solvers within global solvers. And yet, there aremany good software implementations out there from which the entirecommunity could learn something. The scope of this book is moving afew steps toward the systematization of the path that goes from theinvention to the implementation and testing of a global optimizationalgorithm.

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

This book addresses stochastic optimization procedures in a broad manner. The first part offers an overview of relevant optimization philosophies; the second deals with benchmark problems in depth, by applying a selection of optimization procedures. Written primarily with scientists and students from the physical and engineering sciences in mind, this book addresses a larger community of all who wish to learn about stochastic optimization techniques and how to use them.

Game theory, defined in the broadest sense, is a collection of mathematical models designed for the analysis of strategic aspects of situations of conflict and cooperation in a broad spectrum of fields including economics, politics, biology, engineering, and operations research. This book, besides covering the classical results of game theory, places special emphasis on methods of determining `solutions' of various game models. Generalizations reaching beyond the `convexity paradigm' and leading to nonconvex optimization problems are enhanced and discussed in more detail than in standard texts on this subject. The development is theoretical-mathematical interspersed with elucidating interpretations and examples. Audience: The material in the book is accessible to PhD and graduate students and will also be of interest to researchers. Solid knowledge of standard undergraduate mathematics is required to read the book.

Linear Programming provides an in-depth look at simplex based as well as the more recent interior point techniques for solving linear programming problems. Starting with a review of the mathematical underpinnings of these approaches, the text provides details of the primal and dual simplex methods with the primal-dual, composite, and steepest edge simplex algorithms. This then is followed by a discussion of interior point techniques, including projective and affine potential reduction, primal and dual affine scaling, and path following algorithms. Also covered is the theory and solution of the linear complementarity problem using both the complementary pivot algorithm and interior point routines. A feature of the book is its early and extensive development and use of duality theory. Audience: The book is written for students in the areas of mathematics, economics, engineering and management science, and professionals who need a sound foundation in the important and dynamic discipline of linear programming.

Game Theory: Stochastics, Information, Strategies and Cooperation provides a discussion of some relevant topics in game theory. It is composed partially from material compiled by Professor Joachim RosenmA1/4ller when lecturing at IMW, the Institute of Mathematical Economics at the University of Bielefeld. On the other hand, it also contains research topics that are not presented in a typical game theory textbook. Thus, the volume may provide the basis for an advanced course in game theory; simultaneously it may be called a monograph, and, as a third aspect, it also supplies some rather elementary versions of advanced topics of the field. The volume has a non-cooperative and a cooperative part and in both of them the reader is assumed to have some basic knowledge in game theory, for instance, concerning the normal form (bimatrix games, Nash equilibria of the mixed extension, backwards induction in games with perfect information) on one hand and the coalitional function (simple games, convex games, superadditive games, the core, the Shapley volume) on the other hand. Some emphasis is laid on the probabilistic background; however, the author treats stochastic games using the language of probability in order to consider simple models in which measure theory can be omitted.

This is a book on the basics of mathematics and computation and their uses in economics for modern day students and practitioners. The reader is introduced to the basics of numerical analysis as well as the use of computer programs such as Matlab and Excel in carrying out involved computations. Sections are devoted to the use of Maple in mathematical analysis. Examples drawn from recent contributions to economic theory and econometrics as well as a variety of end of chapter exercises help to illustrate and apply the presented concepts.

Cooperative game theory is a booming research area with many new developments in the last few years. So, our main purpose when prep- ing the second edition was to incorporate as much of these new dev- opments as possible without changing the structure of the book. First, this o?ered us the opportunity to enhance and expand the treatment of traditional cooperative games, called here crisp games, and, especially, that of multi-choice games, in the idea to make the three parts of the monograph more balanced. Second, we have used the opportunity of a secondeditiontoupdateandenlargethelistofreferencesregardingthe threemodels of cooperative games. Finally, we have bene?ted fromthis opportunity by removing typos and a few less important results from the ?rst edition of the book, and by slightly polishing the English style and the punctuation, for the sake of consistency along the monograph. The main changes are: (1) Chapter 3 contains an additional section, Section 3. 3, on the - erage lexicographic value, which is a recent one-point solution concept de?ned on the class of balanced crisp games. (2) Chapter 4 is new. It o?ers a brief overview on solution c- cepts for crisp games from the point of view of egalitarian criteria, and presents in Section 4. 2 a recent set-valued solution concept based on egalitarian considerations, namely the equal split-o? set. (3)Chapter5isbasicallyanenlargedversionofChapter4ofthe?rst edition because Section 5. 4 dealing with the relation between convex games and clan games with crisp coalitions is new.

Algorithmic discrete mathematics plays a key role in the development of information and communication technologies, and methods that arise in computer science, mathematics and operations research in particular in algorithms, computational complexity, distributed computing and optimization are vital to modern services such as mobile telephony, online banking and VoIP.

This book examines communication networking from a mathematical viewpoint. The contributing authors took part in the European COST action 293 a four-year program of multidisciplinary research on this subject. In this book they offer introductory overviews and state-of-the-art assessments of current and future research in the fields of broadband, optical, wireless and ad hoc networks. Particular topics of interest are design, optimization, robustness and energy consumption.

The book will be of interest to graduate students, researchers and practitioners in the areas of networking, theoretical computer science, operations research, distributed computing and mathematics."

Most financial and investment decisions are based on considerations of possible future changes and require forecasts on the evolution of the financial world. Time series and processes are the natural tools for describing the dynamic behavior of financial data, leading to the required forecasts. This book presents a survey of the empirical properties of financial time series, their descriptions by means of mathematical processes, and some implications for important financial applications used in many areas like risk evaluation, option pricing or portfolio construction. The statistical tools used to extract information from raw data are introduced. Extensive multiscale empirical statistics provide a solid benchmark of stylized facts (heteroskedasticity, long memory, fat-tails, leverage ), in order to assess various mathematical structures that can capture the observed regularities. The author introduces a broad range of processes and evaluates them systematically against the benchmark, summarizing the successes and limitations of these models from an empirical point of view. The outcome is that only multiscale ARCH processes with long memory, discrete multiplicative structures and non-normal innovations are able to capture correctly the empirical properties. In particular, only a discrete time series framework allows to capture all the stylized facts in a process, whereas the stochastic calculus used in the continuum limit is too constraining. The present volume offers various applications and extensions for this class of processes including high-frequency volatility estimators, market risk evaluation, covariance estimation and multivariate extensions of the processes. The book discusses many practical implications and is addressed to practitioners and quants in the financial industry, as well as to academics, including graduate (Master or PhD level) students. The prerequisites are basic statistics and some elementary financial mathematics."