Since its initial publication, this text has defined courses in dynamic optimization taught to economics and management science students. The two-part treatment covers the calculus of variations and optimal control. 1998 edition.
This book explores discrete-time dynamic optimization and provides a detailed introduction to both deterministic and stochastic models. Covering problems with finite and infinite horizon, as well as Markov renewal programs, Bayesian control models and partially observable processes, the book focuses on the precise modelling of applications in a variety of areas, including operations research, computer science, mathematics, statistics, engineering, economics and finance. Dynamic Optimization is a carefully presented textbook which starts with discrete-time deterministic dynamic optimization problems, providing readers with the tools for sequential decision-making, before proceeding to the more complicated stochastic models. The authors present complete and simple proofs and illustrate the main results with numerous examples and exercises (without solutions). With relevant material covered in four appendices, this book is completely self-contained.
Game theory is the theory of social situations, and the majority of research into the topic focuses on how groups of people interact by developing formulas and algorithms to identify optimal strategies and to predict the outcome of interactions. Only fifty years old, it has already revolutionized economics and finance, and is spreading rapidly to a wide variety of fields. LQ Dynamic Optimization and Differential Games is an assessment of the state of the art in its field and the first modern book on linear-quadratic game theory, one of the most commonly used tools for modelling and analysing strategic decision making problems in economics and management. Linear quadratic dynamic models have a long tradition in economics, operations research and control engineering; and the author begins by describing the one-decision maker LQ dynamic optimization problem before introducing LQ differential games. Covers cooperative and non-cooperative scenarios, and treats the standard information structures (open-loop and feedback). Includes real-life economic examples to illustrate theoretical concepts and results. Presents problem formulations and sound mathematical problem analysis. Includes exercises and solutions, enabling use for self-study or as a course text. Supported by a website featuring solutions to exercises, further examples and computer code for numerical examples. LQ Dynamic Optimization and Differential Games offers a comprehensive introduction to the theory and practice of this extensively used class of economic models, and will appeal to applied mathematicians and econometricians as well as researchers and senior undergraduate/graduate students in economics, mathematics, engineering and management science.
This textbook deals with optimization of dynamic systems. The motivation for undertaking this task is as follows: There is an ever increasing need to produce more efficient, accurate, and lightweight mechanical and electromechanical de vices. Thus, the typical graduating B.S. and M.S. candidate is required to have some familiarity with techniques for improving the performance of dynamic systems. Unfortunately, existing texts dealing with system improvement via optimization remain inaccessible to many of these students and practicing en gineers. It is our goal to alleviate this difficulty by presenting to seniors and beginning graduate students practical efficient techniques for solving engineer ing system optimization problems. The text has been used in optimal control and dynamic system optimization courses at the University of Deleware, the University of Washington and Ohio University over the past four years. The text covers the following material in a straightforward detailed manner: • Static Optimization: The problem of optimizing a function that depends on static variables (i.e., parameters) is considered. Problems with equality and inequality constraints are addressed. • Numerical Methods: Static Optimization: Numerical algorithms for the solution of static optimization problems are presented here. The methods presented can accommodate both the unconstrained and constrained static optimization problems. • Calculus of Variation: The necessary and sufficient conditions for the ex tremum of functionals are presented. Both the fixed final time and free final time problems are considered.
Evolutionary Algorithms (EAs) have grown into a mature field of research in optimization, and have proven to be effective and robust problem solvers for a broad range of static real-world optimization problems. Yet, since they are based on the principles of natural evolution, and since natural evolution is a dynamic process in a changing environment, EAs are also well suited to dynamic optimization problems. Evolutionary Optimization in Dynamic Environments is the first comprehensive work on the application of EAs to dynamic optimization problems. It provides an extensive survey on research in the area and shows how EAs can be successfully used to continuously and efficiently adapt a solution to a changing environment, find a good trade-off between solution quality and adaptation cost, find robust solutions whose quality is insensitive to changes in the environment, find flexible solutions which are not only good but that can be easily adapted when necessary. All four aspects are treated in this book, providing a holistic view on the challenges and opportunities when applying EAs to dynamic optimization problems. The comprehensive and up-to-date coverage of the subject, together with details of latest original research, makes Evolutionary Optimization in Dynamic Environments an invaluable resource for researchers and professionals who are dealing with dynamic and stochastic optimization problems, and who are interested in applying local search heuristics, such as evolutionary algorithms.
This book has been written to address the increasing number of Operations Research and Management Science problems (that is, applications) that involve the explicit consideration of time and of gaming among multiple agents. It is a book that will be used both as a textbook and as a reference and guide by those whose work involves the theoretical aspects of dynamic optimization and differential games.
This book provides a compilation on the state-of-the-art and recent advances of evolutionary computation for dynamic optimization problems. The motivation for this book arises from the fact that many real-world optimization problems and engineering systems are subject to dynamic environments, where changes occur over time. Key issues for addressing dynamic optimization problems in evolutionary computation, including fundamentals, algorithm design, theoretical analysis, and real-world applications, are presented. "Evolutionary Computation for Dynamic Optimization Problems" is a valuable reference to scientists, researchers, professionals and students in the field of engineering and science, particularly in the areas of computational intelligence, nature- and bio-inspired computing, and evolutionary computation.
This book is an updated effort in summarizing the trending topics and new hot research lines in solving dynamic problems using metaheuristics. An analysis of the present state in solving complex problems quickly draws a clear picture: problems that change in time, having noise and uncertainties in their definition are becoming very important. The tools to face these problems are still to be built, since existing techniques are either slow or inefficient in tracking the many global optima that those problems are presenting to the solver technique. Thus, this book is devoted to include several of the most important advances in solving dynamic problems. Metaheuristics are the more popular tools to this end, and then we can find in the book how to best use genetic algorithms, particle swarm, ant colonies, immune systems, variable neighborhood search, and many other bioinspired techniques. Also, neural network solutions are considered in this book. Both, theory and practice have been addressed in the chapters of the book. Mathematical background and methodological tools in solving this new class of problems and applications are included. From the applications point of view, not just academic benchmarks are dealt with, but also real world applications in logistics and bioinformatics are discussed here. The book then covers theory and practice, as well as discrete versus continuous dynamic optimization, in the aim of creating a fresh and comprehensive volume. This book is targeted to either beginners and experienced practitioners in dynamic optimization, since we took care of devising the chapters in a way that a wide audience could profit from its contents. We hope to offer a single source for up-to-date information in dynamic optimization, an inspiring and attractive new research domain that appeared in these last years and is here to stay.
Dynamic programming is an efficient technique for solving optimization problems. It is based on breaking the initial problem down into simpler ones and solving these sub-problems, beginning with the simplest ones. A conventional dynamic programming algorithm returns an optimal object from a given set of objects. This book develops extensions of dynamic programming, enabling us to (i) describe the set of objects under consideration; (ii) perform a multi-stage optimization of objects relative to different criteria; (iii) count the number of optimal objects; (iv) find the set of Pareto optimal points for bi-criteria optimization problems; and (v) to study relationships between two criteria. It considers various applications, including optimization of decision trees and decision rule systems as algorithms for problem solving, as ways for knowledge representation, and as classifiers; optimization of element partition trees for rectangular meshes, which are used in finite element methods for solving PDEs; and multi-stage optimization for such classic combinatorial optimization problems as matrix chain multiplication, binary search trees, global sequence alignment, and shortest paths. The results presented are useful for researchers in combinatorial optimization, data mining, knowledge discovery, machine learning, and finite element methods, especially those working in rough set theory, test theory, logical analysis of data, and PDE solvers. This book can be used as the basis for graduate courses.