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.

An updated and revised edition of the 1986 title Convexity and Optimization in Banach Spaces, this book provides a self-contained presentation of basic results of the theory of convex sets and functions in infinite-dimensional spaces. The main emphasis is on applications to convex optimization and convex optimal control problems in Banach spaces. A distinctive feature is a strong emphasis on the connection between theory and application. This edition has been updated to include new results pertaining to advanced concepts of subdifferential for convex functions and new duality results in convex programming. The last chapter, concerned with convex control problems, has been rewritten and completed with new research concerning boundary control systems, the dynamic programming equations in optimal control theory and periodic optimal control problems. Finally, the structure of the book has been modified to highlight the most recent progression in the field including fundamental results on the theory of infinite-dimensional convex analysis and includes helpful bibliographical notes at the end of each chapter.

This volume is a comprehensive collection of extended contributions from the Workshop on Computational Optimization 2015. It presents recent advances in computational optimization. The volume includes important real life problems like parameter settings for controlling processes in bioreactor, control of ethanol production, minimal convex hill with application in routing algorithms, graph coloring, flow design in photonic data transport system, predicting indoor temperature, crisis control center monitoring, fuel consumption of helicopters, portfolio selection, GPS surveying and so on. It shows how to develop algorithms for them based on new metaheuristic methods like evolutionary computation, ant colony optimization, constrain programming and others. This research demonstrates how some real-world problems arising in engineering, economics, medicine and other domains can be formulated as optimization problems.

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

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

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

"In this book, Peter Bogetoft - THE expert on the theory and practice of benchmarking - provides an in-depth yet very accessible and readable explanation of the best way to do benchmarking, starting from the ground up." Rick Antle William S. Beinecke Professor of Accounting, Yale School of Management CFO, Compensation Valuation, Inc. "I highly recommend this well-written and comprehensive book on measuring and managing performance. Dr. Bogetoft summarizes the fundamental mathematical concepts in an elegant, intuitive, and understandable way." Jon A. Chilingerian Professor, Brandeis University and INSEAD "Bogetoft gives in his book Performance Benchmarking an excellent introduction to the methodological basis of benchmarking." Christian Parbol Director, DONG Energy "This book is the primer on benchmarking for performance management." Albert Birck Business Performance Manager, Maersk Oil "This excellent book provides a non technical introduction for performance management." Misja Mikkers, Director, Dutch Health Care Authority "With this very well written and comprehensive introduction to the many facets of benchmarking in hand, organizations have no excuse for not applying the best and cost effective benchmarking methods in their performance assessments." Stig P. Christensen Senior R&D Director, COWI

Herbert Scarf is a highly esteemed distinguished American economist. He is internationally famous for his early epoch-making work on optimal inventory policies and his highly influential study with Andrew Clark on optimal policies for a multi-echelon inventory problem, which initiated the important and flourishing field of supply chain management. Equally, he has gained world recognition for his classic study on the stability of the Walrasian price adjustment processes and his fundamental analysis on the relationship between the core and the set of competitive equilibria (the so-called Edgeworth conjecture). Further achievements include his remarkable sufficient condition for the existence of a core in non-transferable utility games and general exchange economies, his seminal paper with Lloyd Shapley on housing markets, and his pioneering study on increasing returns and models of production in the presence of indivisibilities. All in all, however, the name of Scarf is always remembered as a synonym for the computation of economic equilibria and fixed points. In the early 1960s he invented a path-breaking technique for computing equilibrium prices.This work has generated a major research field in economics termed Applied General Equilibrium Analysis and a corresponding area in operations research known as Simplicial Fixed Point Methods. This book comprises all his research articles and consists of four volumes. The volume collects Herbert Scarfs papers in the area of Production in Indivisibilities and the Theories of Large Firms.

This volume contains 13 selected keynote papers presented at the Fourth International Conference on Numerical Analysis and Optimization. Held every three years at Sultan Qaboos University in Muscat, Oman, this conference highlights novel and advanced applications of recent research in numerical analysis and optimization. Each peer-reviewed chapter featured in this book reports on developments in key fields, such as numerical analysis, numerical optimization, numerical linear algebra, numerical differential equations, optimal control, approximation theory, applied mathematics, derivative-free optimization methods, programming models, and challenging applications that frequently arise in statistics, econometrics, finance, physics, medicine, biology, engineering and industry. Any graduate student or researched wishing to know the latest research in the field will be interested in this volume. This book is dedicated to the late Professors Mike JD Powell and Roger Fletcher, who were the pioneers and leading figures in the mathematics of nonlinear optimization.

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.

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.

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.

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.

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.

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

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.

The connected dominating set has been a classic subject studied in graph theory since 1975. Since the 1990s, it has been found to have important applications in communication networks, especially in wireless networks, as a virtual backbone. Motivated from those applications, many papers have been published in the literature during last 15 years. Now, the connected dominating set has become a hot research topic in computer science. In this book, we are going to collect recent developments on the connected dominating set, which presents the state of the art in the study of connected dominating sets. The book consists of 16 chapters. Except the 1st one, each chapter is devoted to one problem, and consists of three parts, motivation and overview, problem complexity analysis, and approximation algorithm designs, which will lead the reader to see clearly about the background, formulation, existing important research results, and open problems. Therefore, this would be a very valuable reference book for researchers in computer science and operations research, especially in areas of theoretical computer science, computer communication networks, combinatorial optimization, and discrete 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."

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.

The aim of this book is to furnish the reader with a rigorous and detailed exposition of the concept of control parametrization and time scaling transformation. It presents computational solution techniques for a special class of constrained optimal control problems as well as applications to some practical examples. The book may be considered an extension of the 1991 monograph A Unified Computational Approach Optimal Control Problems, by K.L. Teo, C.J. Goh, and K.H. Wong. This publication discusses the development of new theory and computational methods for solving various optimal control problems numerically and in a unified fashion. To keep the book accessible and uniform, it includes those results developed by the authors, their students, and their past and present collaborators. A brief review of methods that are not covered in this exposition, is also included. Knowledge gained from this book may inspire advancement of new techniques to solve complex problems that arise in the future. This book is intended as reference for researchers in mathematics, engineering, and other sciences, graduate students and practitioners who apply optimal control methods in their work. It may be appropriate reading material for a graduate level seminar or as a text for a course in optimal control.

The implicit function theorem is one of the most important theorems in analysis and its many variants are basic tools in partial differential equations and numerical analysis.

This second edition of "Implicit Functions and Solution Mappings "presents an updated and more complete picture of the field by including solutions of problems that have been solved since the first edition was published, and places old and new results in a broader perspective. The purpose of this self-contained work is to provide a reference on the topic and to provide a unified collection of a number of results which are currently scattered throughout the literature. Updates to this edition include new sections in almost all chapters, new exercises and examples, updated commentaries to chapters and an enlarged index and references section.

By discussing topics such as shape representations, relaxation theory and optimal transport, trends and synergies of mathematical tools required for optimization of geometry and topology of shapes are explored. Furthermore, applications in science and engineering, including economics, social sciences, biology, physics and image processing are covered. Contents Part I Geometric issues in PDE problems related to the infinity Laplace operator Solution of free boundary problems in the presence of geometric uncertainties Distributed and boundary control problems for the semidiscrete Cahn-Hilliard/Navier-Stokes system with nonsmooth Ginzburg-Landau energies High-order topological expansions for Helmholtz problems in 2D On a new phase field model for the approximation of interfacial energies of multiphase systems Optimization of eigenvalues and eigenmodes by using the adjoint method Discrete varifolds and surface approximation Part II Weak Monge-Ampere solutions of the semi-discrete optimal transportation problem Optimal transportation theory with repulsive costs Wardrop equilibria: long-term variant, degenerate anisotropic PDEs and numerical approximations On the Lagrangian branched transport model and the equivalence with its Eulerian formulation On some nonlinear evolution systems which are perturbations of Wasserstein gradient flows Pressureless Euler equations with maximal density constraint: a time-splitting scheme Convergence of a fully discrete variational scheme for a thin-film equatio Interpretation of finite volume discretization schemes for the Fokker-Planck equation as gradient flows for the discrete Wasserstein distance

The study of shape optimization problems encompasses a wide spectrum of academic research with numerous applications to the real world. In this work these problems are treated from both the classical and modern perspectives and target a broad audience of graduate students in pure and applied mathematics, as well as engineers requiring a solid mathematical basis for the solution of practical problems.

Key topics and features:

* Presents foundational introduction to shape optimization theory

* Studies certain classical problems: the isoperimetric problem and the Newton problem involving the best aerodynamical shape, and optimization problems over classes of convex domains

* Treats optimal control problems under a general scheme, giving a topological framework, a survey of "gamma"-convergence, and problems governed by ODE

* Examines shape optimization problems with Dirichlet and Neumann conditions on the free boundary, along with the existence of classical solutions

* Studies optimization problems for obstacles and eigenvalues of elliptic operators

* Poses several open problems for further research

* Substantial bibliography and index

Driven by good examples and illustrations and requiring only a standard knowledge in the calculus of variations, differential equations, and functional analysis, the book can serve as a text for a graduate course in computational methods of optimal design and optimization, as well as an excellent reference for applied mathematicians addressing functional shape optimization problems.