This book should be considered as an introduction to a special dass of hierarchical systems of optimal control, where subsystems are described by partial differential equations of various types. Optimization is carried out by means of a two-level scheme, where the center optimizes coordination for the upper level and subsystems find the optimal solutions for independent local problems. The main algorithm is a method of iterative aggregation. The coordinator solves the problern with macrovariables, whose number is less than the number of initial variables. This problern is often very simple. On the lower level, we have the usual optimal control problems of math ematical physics, which are far simpler than the initial statements. Thus, the decomposition (or reduction to problems ofless dimensions) is obtained. The algorithm constructs a sequence of so-called disaggregated solutions that are feasible for the main problern and converge to its optimal solutionunder certain assumptions ( e.g., under strict convexity of the input functions). Thus, we bridge the gap between two disciplines: optimization theory of large-scale systems and mathematical physics. The first motivation was a special model of branch planning, where the final product obeys a preset assortment relation. The ratio coefficient is maximized. Constraints are given in the form of linear inequalities with block diagonal structure of the part of a matrix that corresponds to subsystems. The central coordinator assem bles the final production from the components produced by the subsystems."

A presentation of general results for discussing local optimality and computation of the expansion of value function and approximate solution of optimization problems, followed by their application to various fields, from physics to economics. The book is thus an opportunity for popularizing these techniques among researchers involved in other sciences, including users of optimization in a wide sense, in mechanics, physics, statistics, finance and economics. Of use to research professionals, including graduate students at an advanced level.

This book is devoted to the mathematical optimization theory and modeling techniques that recently have been applied to the problem of controlling the shape and intensity of the power density distribution in the core of large nuclear reactors. The book has been prepared with the following purposes in mind: 1. To provide, in a condensed manner, the background preparation on reactor kinetics required for a comprehensive description of the main problems encountered in designing spatial control systems for nuclear reactor cores. 2. To present the work that has already been done on this subject and provide the basic mathematical tools required for a full understand ing of the different methods proposed in the literature. 3. To stimulate further work in this challenging area by weighting the advantages and disadvantages of the existing techniques and evaluating their effectiveness and applicability. In addition to coverage of the standard topics on the subject of optimal control for distributed parametersystems, the book includes, at amathemati cal level suitable for graduate students in engineering, discussions of con ceptsoffunctional analysis, the representation theory ofgroups, and integral equations. Although these topics constitute a requisite for a full understanding of the new developments in the area of reactor modeling and control, they are seidom treated together in a single book and, when they are, their presenta tion isoften directed to the mathematician.They are thus relatively unknown to the engineering community."

The purpose of this book is to present a self-contained description of the fun damentals of the theory of nonlinear control systems, with special emphasis on the differential geometric approach. The book is intended as a graduate text as weil as a reference to scientists and engineers involved in the analysis and design of feedback systems. The first version of this book was written in 1983, while I was teach ing at the Department of Systems Science and Mathematics at Washington University in St. Louis. This new edition integrates my subsequent teaching experience gained at the University of Illinois in Urbana-Champaign in 1987, at the Carl-Cranz Gesellschaft in Oberpfaffenhofen in 1987, at the University of California in Berkeley in 1988. In addition to a major rearrangement of the last two Chapters of the first version, this new edition incorporates two additional Chapters at a more elementary level and an exposition of some relevant research findings which have occurred since 1985."

Resources should be used sparingly both from a point of view of economy and eco logy. Thus in controlling industrial, economical and social processes, optimization is the tool of choice. In this area of applied numerical analysis, the INTERNATIONAL FEDERATION OF AUTOMATIC CONTROL (IFAC) acts as a link between research groups in universities, national research laboratories and industry. For this pur pose, the technical committee Mathematics of Control of IFAC organizes biennial conferences with the objective of bringing together experts to exchange ideas, ex periences and future developments in control applications of optimization. There should be a genuine feedback loop between mathematicians, computer scientists, engineers and software developers. This loop should include the design, application and implementation of algorithms. The contributions of industrial practitioners are especially important. These proceedings contain selected papers from a workshop on CONTROL Ap PLICATIONS OF OPTIMIZATION, which took place at the Fachhochschule Miinchen in September 1992. The workshop was the ninth in a series of very successful bien nial meetings, starting with the Joint Automatic Control Conference in Denver in 1978 and followed by conferences in London, Oberpfaffenhofen, San Francisco, Ca pri, Tbilisi and Paris. The workshop was attended by ninety researchers from four continents. This volume represents the state of the art in the field, with emphasis on progress made since the publication of the proceedings of the Capri meeting, edited by G. di Pillo under the title 'Control Applications of Optimization and Nonlinear Programming'."

Primary Audience for the Book * Specialists in numerical computations who are interested in algorithms with automatic result verification. * Engineers, scientists, and practitioners who desire results with automatic verification and who would therefore benefit from the experience of suc cessful applications. * Students in applied mathematics and computer science who want to learn these methods. Goal Of the Book This book contains surveys of applications of interval computations, i. e. , appli cations of numerical methods with automatic result verification, that were pre sented at an international workshop on the subject in EI Paso, Texas, February 23-25, 1995. The purpose of this book is to disseminate detailed and surveyed information about existing and potential applications of this new growing field. Brief Description of the Papers At the most fundamental level, interval arithmetic operations work with sets: The result of a single arithmetic operation is the set of all possible results as the operands range over the domain. For example, [0. 9,1. 1] + [2. 9,3. 1] = [3. 8,4. 2], where [3. 8,4. 2] = {x + ylx E [0. 9,1. 1] and y E [3. 8,4. 2]}. The power of interval arithmetic comes from the fact that (i) the elementary operations and standard functions can be computed for intervals with formulas and subroutines; and (ii) directed roundings can be used, so that the images of these operations (e. g.

"Fixed-Point Algorithms for Inverse Problems in Science and Engineering" presents some of the most recent work from top-notch researchers studying projection and other first-order fixed-point algorithms in several areas of mathematics and the applied sciences. The material presented provides a survey of the state-of-the-art theory and practice in fixed-point algorithms, identifying emerging problems driven by applications, and discussing new approaches for solving these problems. This book incorporates diverse perspectives from broad-ranging areas of research including, variational analysis, numerical linear algebra, biotechnology, materials science, computational solid-state physics, and chemistry. Topics presented include: Theory of Fixed-point algorithms: convex analysis, convex optimization, subdifferential calculus, nonsmooth analysis, proximal point methods, projection methods, resolvent and related fixed-point theoretic methods, and monotone operator theory. Numerical analysis of fixed-point algorithms: choice of step lengths, of weights, of blocks for block-iterative and parallel methods, and of relaxation parameters; regularization of ill-posed problems; numerical comparison of various methods. Areas of Applications: engineering (image and signal reconstruction and decompression problems), computer tomography and radiation treatment planning (convex feasibility problems), astronomy (adaptive optics), crystallography (molecular structure reconstruction), computational chemistry (molecular structure simulation) and other areas. Because of the variety of applications presented, this book can easily serve as a basis for new and innovated research and collaboration.

Nonconvex Optimization is a multi-disciplinary research field that deals with the characterization and computation of local/global minima/maxima of nonlinear, nonconvex, nonsmooth, discrete and continuous functions. Nonconvex optimization problems are frequently encountered in modeling real world systems for a very broad range of applications including engineering, mathematical economics, management science, financial engineering, and social science. This contributed volume consists of selected contributions from the Advanced Training Programme on Nonconvex Optimization and Its Applications held at Banaras Hindu University in March 2009. It aims to bring together new concepts, theoretical developments, and applications from these researchers. Both theoretical and applied articles are contained in this volume which adds to the state of the art research in this field. Topics in Nonconvex Optimization is suitable for advanced graduate students and researchers in this area.

This volume brings forth a set of papers presented at the conference on "Varia tional Inequalities and network equilibrium problems," held in Erice at the "G. Stam pacchia" School of the "E. Majorana" Centre for Scientific Culture in the period 19 25 June 1994. The meeting was conceived to contribute to the exchange between Variational Analysis and equilibrium problems, especially those related to network design. Most of the approaches and viewpoints of these fields are present in the volume, both as concerns the theory and the applications of equilibrium problems to transportation, computer and electric networks, to market behavior, and to bi level programming. Being convinced of the great importance of equilibrium problems as well as of their complexity, the organizers hope that the merging of points of view coming from differ ent fields will stimulate theoretical research and applications. In this context Variational and Quasi Variational Inequalities have shown them selves to be very important models for equilibrium problems. As a consequence in the last two decades they have received a lot of attention both as to mathematical inves tigation and applications. The proof that the above mentioned equilibrium problems can be expressed, in terms of Variational or Quasi Variational Inequalities also in the non standard and non symmetric cases, has been a crucial improvement."

Hamilton-Jacobi equations and other types of partial differential equa- tions of the first order are dealt with in many branches of mathematics, mechanics, and physics. These equations are usually nonlinear, and func- tions vital for the considered problems are not smooth enough to satisfy these equations in the classical sense. An example of such a situation can be provided by the value function of a differential game or an optimal control problem. It is known that at the points of differentiability this function satisfies the corresponding Hamilton-Jacobi-Isaacs-Bellman equation. On the other hand, it is well known that the value function is as a rule not everywhere differentiable and therefore is not a classical global solution. Thus in this case, as in many others where first-order PDE's are used, there arises necessity to introduce a notion of generalized solution and to develop theory and methods for constructing these solutions. In the 50s-70s, problems that involve nonsmooth solutions of first- order PDE's were considered by Bakhvalov, Evans, Fleming, Gel'fand, Godunov, Hopf, Kuznetzov, Ladyzhenskaya, Lax, Oleinik, Rozhdestven- ski1, Samarskii, Tikhonov, and other mathematicians. Among the inves- tigations of this period we should mention the results of S.N. Kruzhkov, which were obtained for Hamilton-Jacobi equation with convex Hamilto- nian. A review of the investigations of this period is beyond the limits of the present book. A sufficiently complete bibliography can be found in [58, 126, 128, 141].

Shortly after the end of World War II high-speed digital computing machines were being developed. It was clear that the mathematical aspects of com putation needed to be reexamined in order to make efficient use of high-speed digital computers for mathematical computations. Accordingly, under the leadership of Min a Rees, John Curtiss, and others, an Institute for Numerical Analysis was set up at the University of California at Los Angeles under the sponsorship of the National Bureau of Standards. A similar institute was formed at the National Bureau of Standards in Washington, D. C. In 1949 J. Barkeley Rosser became Director of the group at UCLA for a period of two years. During this period we organized a seminar on the study of solu tions of simultaneous linear equations and on the determination of eigen values. G. Forsythe, W. Karush, C. Lanczos, T. Motzkin, L. J. Paige, and others attended this seminar. We discovered, for example, that even Gaus sian elimination was not well understood from a machine point of view and that no effective machine oriented elimination algorithm had been developed. During this period Lanczos developed his three-term relationship and I had the good fortune of suggesting the method of conjugate gradients. We dis covered afterward that the basic ideas underlying the two procedures are essentially the same. The concept of conjugacy was not new to me. In a joint paper with G. D."

The problem of controlling or stabilizing a system of differential equa tions in the presence of random disturbances is intuitively appealing and has been a motivating force behind a wide variety of results grouped loosely together under the heading of "Stochastic Control." This book is concerned with a special instance of this general problem, the "Adaptive LQ Regulator," which is a stochastic control problem of partially observed type that can, in certain cases, be solved explicitly. We first describe this problem, as it is the focal point for the entire book, and then describe the contents of the book. The problem revolves around an uncertain linear system x(O) = x~ in R", where 0 E {1, ... , N} is a random variable representing this uncertainty and (Ai' B , C) and xJ are the coefficient matrices and initial state, respectively, of j j a linear control system, for eachj = 1, ... , N. A common assumption is that the mechanism causing this uncertainty is additive noise, and that conse quently the "controller" has access only to the observation process y( . ) where y = Cex +~.

When the Tyrian princess Dido landed on the North African shore of the Mediterranean sea she was welcomed by a local chieftain. He offered her all the land that she could enclose between the shoreline and a rope of knotted cowhide. While the legend does not tell us, we may assume that Princess Dido arrived at the correct solution by stretching the rope into the shape of a circular arc and thereby maximized the area of the land upon which she was to found Carthage. This story of the founding of Carthage is apocryphal. Nonetheless it is probably the first account of a problem of the kind that inspired an entire mathematical discipline, the calculus of variations and its extensions such as the theory of optimal control. This book is intended to present an introductory treatment of the calculus of variations in Part I and of optimal control theory in Part II. The discussion in Part I is restricted to the simplest problem of the calculus of variations. The topic is entirely classical; all of the basic theory had been developed before the turn of the century. Consequently the material comes from many sources; however, those most useful to me have been the books of Oskar Bolza and of George M. Ewing. Part II is devoted to the elementary aspects of the modern extension of the calculus of variations, the theory of optimal control of dynamical systems.

Most books on inventory theory use the item approach to determine stock levels, ignoring the impact of unit cost, echelon location, and hardware indenture. Optimal Inventory Modeling of Systems is the first book to take the system approach to inventory modeling. The result has been dramatic reductions in the resources to operate many systems - fleets of aircraft, ships, telecommunications networks, electric utilities, and the space station. Although only four chapters and appendices are totally new in this edition, extensive revisions have been made in all chapters, adding numerous worked-out examples. Many new applications have been added including commercial airlines, experience gained during Desert Storm, and adoption of the Windows interface as a standard for personal computer models.

Focusing on the mathematical description of stochastic dynamics in discrete as well as in continuous time, this book investigates such dynamical phenomena as perturbations, bifurcations and chaos. It also introduces new ideas for the exploration of infinite dimensional systems, in particular stochastic partial differential equations. Example applications are presented from biology, chemistry and engineering, while describing numerical treatments of stochastic systems.

In the mathematical treatment of many problems which arise in physics, economics, engineering, management, etc., the researcher frequently faces two major difficulties: infinite dimensionality and randomness of the evolution process. Infinite dimensionality occurs when the evolution in time of a process is accompanied by a space-like dependence; for example, spatial distribution of the temperature for a heat-conductor, spatial dependence of the time-varying displacement of a membrane subject to external forces, etc. Randomness is intrinsic to the mathematical formulation of many phenomena, such as fluctuation in the stock market, or noise in communication networks. Control theory of distributed parameter systems and stochastic systems focuses on physical phenomena which are governed by partial differential equations, delay-differential equations, integral differential equations, etc., and stochastic differential equations of various types. This has been a fertile field of research with over 40 years of history, which continues to be very active under the thrust of new emerging applications.Among the subjects covered are: * Control of distributed parameter systems; * Stochastic control; * Applications in finance/insurance/manufacturing; * Adapted control; * Numerical approximation . It is essential reading for applied mathematicians, control theorists, economic/financial analysts and engineers.

Evolutionary computation techniques have attracted increasing att- tions in recent years for solving complex optimization problems. They are more robust than traditional methods based on formal logics or mathematical programming for many real world OR/MS problems. E- lutionary computation techniques can deal with complex optimization problems better than traditional optimization techniques. However, most papers on the application of evolutionary computation techniques to Operations Research /Management Science (OR/MS) problems have scattered around in different journals and conference proceedings. They also tend to focus on a very special and narrow topic. It is the right time that an archival book series publishes a special volume which - cludes critical reviews of the state-of-art of those evolutionary com- tation techniques which have been found particularly useful for OR/MS problems, and a collection of papers which represent the latest devel- ment in tackling various OR/MS problems by evolutionary computation techniques. This special volume of the book series on Evolutionary - timization aims at filling in this gap in the current literature. The special volume consists of invited papers written by leading - searchers in the field. All papers were peer reviewed by at least two recognised reviewers. The book covers the foundation as well as the practical side of evolutionary optimization.

Optimization problems in practice are diverse and evolve over time, giving rise to - quirements both for ready-to-use optimization software packages and for optimization software libraries, which provide more or less adaptable building blocks for app- cation-specific software systems. In order to apply optimization methods to a new type of problem, corresponding models and algorithms have to be "coded" so that they are accessible to a computer. One way to achieve this step is the use of a mod- ing language. Such modeling systems provide an excellent interface between models and solvers, but only for a limited range of model types (in some cases, for example, linear) due, in part, to limitations imposed by the solvers. Furthermore, while m- eling systems especially for heuristic search are an active research topic, it is still an open question as to whether such an approach may be generally successful. Modeling languages treat the solvers as a "black box" with numerous controls. Due to variations, for example, with respect to the pursued objective or specific problem properties, - dressing real-world problems often requires special purpose methods. Thus, we are faced with the difficulty of efficiently adapting and applying appropriate methods to these problems. Optimization software libraries are intended to make it relatively easy and cost effective to incorporate advanced planning methods in application-specific software systems. A general classification provides a distinction between callable packages, nume- cal libraries, and component libraries.

In the late 1950's, the group of Soviet mathematicians consisting of L. S. Pontryagin, V. G. Boltyanskii, R. V. Gamkrelidze, and E. F. Mishchenko made fundamental contributions to optimal control theory. Much of their work was collected in their monograph, The Mathematical Theory of Optimal Processes. Subsequently, Professor Gamkrelidze made further important contributions to the theory of necessary conditions for problems of optimal control and general optimization problems. In the present monograph, Professor Gamkrelidze presents his current view of the fundamentals of optimal control theory. It is intended for use in a one-semester graduate course or advanced undergraduate course. We are now making these ideas available in English to all those interested in optimal control theory. West Lafayette, Indiana, USA Leonard D. Berkovitz Translation Editor Vll Preface This book is based on lectures I gave at the Tbilisi State University during the fall of 1974. It contains, in essence, the principles of general control theory and proofs of the maximum principle and basic existence theorems of optimal control theory. Although the proofs of the basic theorems presented here are far from being the shortest, I think they are fully justified from the conceptual view point. In any case, the notions we introduce and the methods developed have one unquestionable advantage -they are constantly used throughout control theory, and not only for the proofs of the theorems presented in this book."

INRIA, Institut National de Recherche en Informatique et en Automatique

The generalized area of multiple criteria decision making (MCDM) can be defined as the body of methods and procedures by which the concern for multiple conflicting criteria can be formally incorporated into the analytical process. MCDM consists mostly of two branches, multiple criteria optimization and multi-criteria decision analysis (MCDA). While MCDA is typically concerned with multiple criteria problems that have a small number of alternatives often in an environment of uncertainty (location of an airport, type of drug rehabilitation program), multiple criteria optimization is typically directed at problems formulated within a mathematical programming framework, but with a stack of objectives instead of just one (river basin management, engineering component design, product distribution). It is about the most modern treatment of multiple criteria optimization that this book is concerned. I look at this book as a nicely organized and well-rounded presentation of what I view as "new wave" topics in multiple criteria optimization. Looking back to the origins of MCDM, most people agree that it was not until about the early 1970s that multiple criteria optimization c- gealed as a field. At this time, and for about the following fifteen years, the focus was on theories of multiple objective linear programming that subsume conventional (single criterion) linear programming, algorithms for characterizing the efficient set, theoretical vector-maximum dev- opments, and interactive procedures.

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.

A unified approach is proposed for applied mechanics and optimal control theory. The Hamilton system methodology in analytical mechanics is used for eigenvalue problems, vibration theory, gyroscopic systems, structural mechanics, wave-guide, LQ control, Kalman filter, robust control etc. All aspects are described in the same unified methodology. Numerical methods for all these problems are provided and given in meta-language, which can be implemented easily on the computer. Precise integration methods both for initial value problems and for two-point boundary value problems are proposed, which result in the numerical solutions of computer precision. Key Features of the text include: -Unified approach based on Hamilton duality system theory and symplectic mathematics. -Gyroscopic system vibration, eigenvalue problems. -Canonical transformation applied to non-linear systems. -Pseudo-excitation method for structural random vibrations. -Precise integration of two-point boundary value problems. -Wave propagation along wave-guides, scattering. -Precise solution of Riccati differential equations. -Kalman filtering. -HINFINITY theory of control and filter.

A clear and succinct presentation of the essentials of this subject, together with some of its applications and a generous helping of interesting exercises. Following an introductory chapter with a taste of what is to come, the next three chapters constitute a course in nonsmooth analysis and identify a coherent and comprehensive approach to the subject, leading to an efficient, natural, and powerful body of theory. The whole is rounded off with a self-contained introduction to the theory of control of ordinary differential equations. The authors have incorporated a number of new results which clarify the relationships between the different schools of thought in the subject, with the aim of making nonsmooth analysis accessible to a wider audience. End-of-chapter problems offer scope for deeper understanding.