This volume is a collection of research works to honor the late Professor Mark H.A. Davis, whose pioneering work in the areas of Stochastic Processes, Filtering, and Stochastic Optimization spans more than five decades. Invited authors include his dissertation advisor, past collaborators, colleagues, mentees, and graduate students of Professor Davis, as well as scholars who have worked in the above areas. Their contributions may expand upon topics in piecewise deterministic processes, pathwise stochastic calculus, martingale methods in stochastic optimization, filtering, mean-field games, time-inconsistency, as well as impulse, singular, risk-sensitive and robust stochastic control.

A comprehensive work in finite-value systems that covers the latest achievements using the semi-tensor product method, on various kinds of finite-value systems. These results occupy the highest position in the analysis and control of this field. It not only covers all aspects of research in finite-value systems, but also presents the mathematical derivation for each conclusion in depth. The book contains examples to provide a better understanding of the practical applications of finite-value systems. It will serve as a textbook for graduate students of Cybernetics, Mathematical, and Biology, and a reference for readers interested in the theory of finite-value systems.

Metaheuristic optimization is a higher-level procedure or heuristic designed to find, generate, or select a heuristic (partial search algorithm) that may provide a sufficiently good solution to an optimization problem, especially with incomplete or imperfect information or limited computation capacity. This is usually applied when two or more objectives are to be optimized simultaneously. This book is presented with two major objectives. Firstly, it features chapters by eminent researchers in the field providing the readers about the current status of the subject. Secondly, algorithm-based optimization or advanced optimization techniques, which are applied to mostly non-engineering problems, are applied to engineering problems. This book will also serve as an aid to both research and industry. Usage of these methodologies would enable the improvement in engineering and manufacturing technology and support an organization in this era of low product life cycle. Features: Covers the application of recent and new algorithms Focuses on the development aspects such as including surrogate modeling, parallelization, game theory, and hybridization Presents the advances of engineering applications for both single-objective and multi-objective optimization problems Offers recent developments from a variety of engineering fields Discusses Optimization using Evolutionary Algorithms and Metaheuristics applications in engineering

This book presents best practices involving applications of decision sciences, business tactics and behavioral sciences for COVID-19. Addressing concrete problems in these vital fields, it focuses on theoretical and methodological investigations of managerial decisions that drive production and service enterprises' productivity and success. Moreover, it presents optimization techniques and tools that can also be adopted for other applications in various research areas after a thorough analysis of the specific problem. The book is intended for researchers and practitioners seeking optimum solutions to real-life problems in various application areas concerning COVID-19, helping them make scientifically founded decisions.

The objective of the third edition of Game Theory: A Nontechnical Introduction to the Analysis of Strategy is to introduce the ideas of game theory in a way that is approachable, intuitive, and interdisciplinary. Relying on the Karplus Learning Cycle, the book is intended to teach by example. Noncooperative equilibrium concepts such as Nash equilibrium play the central role. In this third edition, increased stress is placed on the concept of rationalizable strategies, which has proven in teaching practice to assist students in making the bridge from intuitive to more formal concepts of noncooperative equilibrium.The Instructor Manual and PowerPoint Slides for the book are available upon request for all instructors who adopt this book as a course text. Please send your request to [email protected].

New Trends in Control Theory is a graduate-level monographic textbook. It is a contemporary overview of modern trends in control theory. The introductory chapter gives the geometrical and quantum background, which is a necessary minimum for comprehensive reading of the book. The second chapter gives the basics of classical control theory, both linear and nonlinear. The third chapter shows the key role that Euclidean group of rigid motions plays in modern robotics and biomechanics. The fourth chapter gives an overview of modern quantum control, from both theoretical and measurement perspectives. The fifth chapter presents modern control and synchronization methods in complex systems and human crowds. The appendix provides the rest of the background material complementary to the introductory chapter. The book is designed as a one-semester course for engineers, applied mathematicians, computer scientists and physicists, both in industry and academia. It includes a most relevant bibliography on the subject and detailed index.

This collection of selected contributions gives an account of recent developments in dynamic game theory and its applications, covering both theoretical advances and new applications of dynamic games in such areas as pursuit-evasion games, ecology, and economics. Written by experts in their respective disciplines, the chapters are an outgrowth of presentations from the 11th International Symposium on Dynamic Games and Applications.

Key topics covered include:

* stochastic and differential games

* dynamic games and their applications in various areas, such as ecology and economics

* numerical methods and algorithms in dynamic games

* zero- and nonzero-sum games

* pursuit-evasion games

* evolutionary game theory and applications

The work will serve as a state-of-the art account of recent advances in dynamic game theory and its applications for researchers, practitioners, and advanced students in applied mathematics, mathematical finance, and engineering.

Mathematically, most of the interesting optimization problems can be formulated to optimize some objective function, subject to some equality and/or inequality constraints. This book introduces some classical and basic results of optimization theory, including nonlinear programming with Lagrange multiplier method, the Karush-Kuhn-Tucker method, Fritz John's method, problems with convex or quasi-convex constraints, and linear programming with geometric method and simplex method.A slim book such as this which touches on major aspects of optimization theory will be very much needed for most readers. We present nonlinear programming, convex programming, and linear programming in a self-contained manner. This book is for a one-semester course for upper level undergraduate students or first/second year graduate students. It should also be useful for researchers working on many interdisciplinary areas other than optimization.

This book covers the issues related to optimization of engineering and management problems using soft computing techniques with an industrial outlook. It covers a broad area related to real life complex decision making problems using a heuristics approach. It also explores a wide perspective and future directions in industrial engineering research on a global platform/scenario. The book highlights the concept of optimization, presents various soft computing techniques, offers sample problems, and discusses related software programs complete with illustrations. Features Explains the concept of optimization and relevance to soft computing techniques towards optimal solution in engineering and management Presents various soft computing techniques Offers problems and their optimization using various soft computing techniques Discusses related software programs, with illustrations Provides a step-by-step tutorial on how to handle relevant software for obtaining the optimal solution to various engineering problems

This book introduces several mathematical models in assembly line balancing based on stochastic programming and develops exact and heuristic methods to solve them. An assembly line system is a manufacturing process in which parts are added in sequence from workstation to workstation until the final assembly is produced. In an assembly line balancing problem, tasks belonging to different product models are allocated to workstations according to their processing times and precedence relationships among tasks. It incorporates two features, uncertain task times, and demand volatility, separately and simultaneously, into the conventional assembly line balancing model. A real-life case study related to the mask production during the COVID-19 pandemic is presented to illustrate the application of the proposed framework and methodology. The book is intended for graduate students who are interested in combinatorial optimizations in manufacturing with uncertain input.

Fractional evolution inclusions are an important form of differential inclusions within nonlinear mathematical analysis. They are generalizations of the much more widely developed fractional evolution equations (such as time-fractional diffusion equations) seen through the lens of multivariate analysis. Compared to fractional evolution equations, research on the theory of fractional differential inclusions is however only in its initial stage of development. This is important because differential models with the fractional derivative providing an excellent instrument for the description of memory and hereditary properties, and have recently been proved valuable tools in the modeling of many physical phenomena. The fractional order models of real systems are always more adequate than the classical integer order models, since the description of some systems is more accurate when the fractional derivative is used. The advantages of fractional derivatization become evident in modeling mechanical and electrical properties of real materials, description of rheological properties of rocks and in various other fields. Such models are interesting for engineers and physicists as well as so-called pure mathematicians. Phenomena investigated in hybrid systems with dry friction, processes of controlled heat transfer, obstacle problems and others can be described with the help of various differential inclusions, both linear and nonlinear. Fractional Evolution Equations and Inclusions is devoted to a rapidly developing area of the research for fractional evolution equations & inclusions and their applications to control theory. It studies Cauchy problems for fractional evolution equations, and fractional evolution inclusions with Hille-Yosida operators. It discusses control problems for systems governed by fractional evolution equations. Finally it provides an investigation of fractional stochastic evolution inclusions in Hilbert spaces.

This is the first book about the discrete ordered median problem (DOMP), which unifies many classical and new facility location problems. Several exact and heuristic approaches are developed in this book in order to solve the DOMP.

Audience: The book is suitable for researchers in location theory, and graduate students in combinatorial optimization.

Linear programming attracted the interest of mathematicians during and after World War II when the first computers were constructed and methods for solving large linear programming problems were sought in connection with specific practical problems for example, providing logistical support for the U.S. Armed Forces or modeling national economies. Early attempts to apply linear programming methods to solve practical problems failed to satisfy expectations. There were various reasons for the failure. One of them, which is the central topic of this book, was the inexactness of the data used to create the models. This phenomenon, inherent in most practical problems, has been dealt with in several ways. At first, linear programming models used average values of inherently vague coefficients, but the optimal solutions of these models were not always optimal for the original problem itself. Later researchers developed the stochastic linear programming approach, but this too has its limitations. Recently, interest has been given to linear programming problems with data given as intervals, convex sets and/or fuzzy sets. literature has not presented a unified theory. Linear Optimization Problems with Inexact Data attempts to present a comprehensive treatment of linear optimization with inexact data, summarizing existing results and presenting new ones within a unifying framework.

This book provides a clear understanding regarding the fundamentals of matrix and determinant from introduction to its real-life applications. The topic is considered one of the most important mathematical tools used in mathematical modelling. Matrix and Determinant: Fundamentals and Applications is a small self-explanatory and well synchronized book that provides an introduction to the basics along with well explained applications. The theories in the book are covered along with their definitions, notations, and examples. Illustrative examples are listed at the end of each covered topic along with unsolved comprehension questions, and real-life applications. This book provides a concise understanding of matrix and determinate which will be useful to students as well as researchers.

Classical decision theory evaluates entire worlds, specified so as to include everything a decision-maker cares about. Thus applying decision theory requires performing computations far beyond an ordinary decision-maker's ability. In this book Paul Weirich explains how individuals can simplify and streamline their choices. He shows how different 'parts' of options (intrinsic, temporal, spatiotemporal, causal) are separable, so that we can know what difference one part makes to the value of an option, regardless of what happens in the other parts. He suggests that the primary value of options is found in basic intrinsic attitudes towards outcomes: desires, aversions, or indifferences. And using these two facts he argues that we need only compare small parts of the options we face in order to make a rational decision. This important book will interest readers in decision theory, economics, and the behavioral sciences.

This book focuses largely on constrained optimization. It begins with a substantial treatment of linear programming and proceeds to convex analysis, network flows, integer programming, quadratic programming, and convex optimization. Along the way, dynamic programming and the linear complementarity problem are touched on as well. This book aims to be the first introduction to the topic. Specific examples and concrete algorithms precede more abstract topics. Nevertheless, topics covered are developed in some depth, a large number of numerical examples worked out in detail, and many recent results are included, most notably interior-point methods. The exercises at the end of each chapter both illustrate the theory, and, in some cases, extend it. Optimization is not merely an intellectual exercise: its purpose is to solve practical problems on a computer. Accordingly, the book comes with software that implements the major algorithms studied. At this point, software for the following four algorithms is available: The two-phase simplex method The primal-dual simplex method The path-following interior-point method The homogeneous self-dual methods.GBP/LISTGBP.

This book is for those interested in number systems, abstract algebra, and analysis. It provides an understanding of negative and fractional numbers with theoretical background and explains rationale of irrational and complex numbers in an easy to understand format. This book covers the fundamentals, proof of theorems, examples, definitions, and concepts. It explains the theory in an easy and understandable manner and offers problems for understanding and extensions of concept are included. The book provides concepts in other fields and includes an understanding of handling of numbers by computers. Research scholars and students working in the fields of engineering, science, and different branches of mathematics will find this book of interest, as it provides the subject in a clear and concise way.

This open access book demonstrates all the steps required to design heuristic algorithms for difficult optimization. The classic problem of the travelling salesman is used as a common thread to illustrate all the techniques discussed. This problem is ideal for introducing readers to the subject because it is very intuitive and its solutions can be graphically represented. The book features a wealth of illustrations that allow the concepts to be understood at a glance. The book approaches the main metaheuristics from a new angle, deconstructing them into a few key concepts presented in separate chapters: construction, improvement, decomposition, randomization and learning methods. Each metaheuristic can then be presented in simplified form as a combination of these concepts. This approach avoids giving the impression that metaheuristics is a non-formal discipline, a kind of cloud sculpture. Moreover, it provides concrete applications of the travelling salesman problem, which illustrate in just a few lines of code how to design a new heuristic and remove all ambiguities left by a general framework. Two chapters reviewing the basics of combinatorial optimization and complexity theory make the book self-contained. As such, even readers with a very limited background in the field will be able to follow all the content.

Differential equations play a noticeable role in engineering, physics, economics, and other disciplines. They permit us to model changing forms in both mathematical and physical problems. These equations are precisely used when a deterministic relation containing some continuously varying quantities and their rates of change in space and/or time is recognized or postulated. This book is intended to provide a straightforward introduction to the concept of partial differential equations. It provides a diversity of numerical examples framed to nurture the intellectual level of scholars. It includes enough examples to provide students with a clear concept and also offers short questions for comprehension. Construction of real-life problems is considered in the last chapter along with applications. Research scholars and students working in the fields of engineering, physics, and different branches of mathematics need to learn the concepts of partial differential equations to solve their problems. This book will serve their needs instead of having to use more complex books that contain more concepts than needed.

Optimization is the act of obtaining the "best" result under given circumstances. In design, construction, and maintenance of any engineering system, engineers must make technological and managerial decisions to minimize either the effort or cost required or to maximize benefits. There is no single method available for solving all optimization problems efficiently. Several optimization methods have been developed for different types of problems. The optimum-seeking methods are mathematical programming techniques (specifically, nonlinear programming techniques). Nonlinear Optimization: Models and Applications presents the concepts in several ways to foster understanding. Geometric interpretation: is used to re-enforce the concepts and to foster understanding of the mathematical procedures. The student sees that many problems can be analyzed, and approximate solutions found before analytical solutions techniques are applied. Numerical approximations: early on, the student is exposed to numerical techniques. These numerical procedures are algorithmic and iterative. Worksheets are provided in Excel, MATLAB (R), and Maple (TM) to facilitate the procedure. Algorithms: all algorithms are provided with a step-by-step format. Examples follow the summary to illustrate its use and application. Nonlinear Optimization: Models and Applications: Emphasizes process and interpretation throughout Presents a general classification of optimization problems Addresses situations that lead to models illustrating many types of optimization problems Emphasizes model formulations Addresses a special class of problems that can be solved using only elementary calculus Emphasizes model solution and model sensitivity analysis About the author: William P. Fox is an emeritus professor in the Department of Defense Analysis at the Naval Postgraduate School. He received his Ph.D. at Clemson University and has taught at the United States Military Academy and at Francis Marion University where he was the chair of mathematics. He has written many publications, including over 20 books and over 150 journal articles. Currently, he is an adjunct professor in the Department of Mathematics at the College of William and Mary. He is the emeritus director of both the High School Mathematical Contest in Modeling and the Mathematical Contest in Modeling.

This book is for beginners who are struggling to understand and optimize non-linear problems. The content will help readers gain an understanding and learn how to formulate real-world problems and will also give insight to many researchers for their future prospects. It proposes a mind map for conceptual understanding and includes sufficient solved examples for reader comprehension. The theory is explained in a lucid way. The variety of examples are framed to raise the thinking level of the reader and the formulation of real-world problems are included in the last chapter along with applications. The book is self-explanatory, well synchronized and written for undergraduate, post graduate and research scholars.

Optimization and decision making are integral parts of any manufacturing process and management system. The objective of this book is to demonstrate the confluence of theory and applications of various types of multi-criteria decision making and optimization techniques with reference to textile manufacturing and management. Divided into twelve chapters, it discusses various multi-criteria decision-making methods such as AHP, TOPSIS, ELECTRE, and optimization techniques like linear programming, fuzzy linear programming, quadratic programming, in textile domain. Multi-objective optimization problems have been dealt with two approaches, namely desirability function and evolutionary algorithm. Key Features Exclusive title covering textiles and soft computing fields including optimization and decision making Discusses concepts of traditional and non-traditional optimization methods with textile examples Explores pertinent single-objective and multi-objective optimizations Provides MATLAB coding in the Appendix to solve various types of multi-criteria decision making and optimization problems Includes examples and case studies related to textile engineering and management

In today's confrontational and connected world, communication is the key strategic act. This book uses drama theory-a radical extension of game theory-to show how best to communicate so as to manage the emotionally charged confrontations occurring in any worthwhile relationship. Alongside a toolset that provides a systematic framework for analysing conflicts, drama theory explains why people need to listen to, and rely on, their feelings to help shake themselves out of fixed, unproductive positions and to find new ways of solving tough problems. This guide provides a sufficient grounding in the approach to enable you to apply it immediately for your own benefit and for the benefit of those with whom you work. A host of inspirational examples are included based upon actual situations in social and personal relations, business and organisational relations, defence and political management. These will give you an entirely fresh way of seeing how power is exercised in everyday interpersonal exchanges and a greater critical awareness of such factors as subtext and plotholes in public narratives. Using this approach you will be able to overcome the dilemmas of credibility and disbelief to build compelling messages that underpin your strategic intent. Moving beyond the vague platitudes of concepts like emotional intelligence, drama theory will also help you to avoid the pathologies that bedevil the process of managing conflicts and find ways of achieving authentic resolutions.

This book is intended to be used as a textbook for graduate students studying theoretical computer science. It can also be used as a reference book for researchers in the area of design and analysis of approximation algorithms. Design and Analysis of Approximation Algorithms is a graduate course in theoretical computer science taught widely in the universities, both in the United States and abroad. There are, however, very few textbooks available for this course. Among those available in the market, most books follow a problem-oriented format; that is, they collected many important combinatorial optimization problems and their approximation algorithms, and organized them based on the types, or applications, of problems, such as geometric-type problems, algebraic-type problems, etc. Such arrangement of materials is perhaps convenient for a researcher to look for the problems and algorithms related to his/her work, but is difficult for a student to capture the ideas underlying the various algorithms. In the new book proposed here, we follow a more structured, technique-oriented presentation. We organize approximation algorithms into different chapters, based on the design techniques for the algorithms, so that the reader can study approximation algorithms of the same nature together. It helps the reader to better understand the design and analysis techniques for approximation algorithms, and also helps the teacher to present the ideas and techniques of approximation algorithms in a more unified way.

This book discusses an important area of numerical optimization, called interior-point method. This topic has been popular since the 1980s when people gradually realized that all simplex algorithms were not convergent in polynomial time and many interior-point algorithms could be proved to converge in polynomial time. However, for a long time, there was a noticeable gap between theoretical polynomial bounds of the interior-point algorithms and efficiency of these algorithms. Strategies that were important to the computational efficiency became barriers in the proof of good polynomial bounds. The more the strategies were used in algorithms, the worse the polynomial bounds became. To further exacerbate the problem, Mehrotra's predictor-corrector (MPC) algorithm (the most popular and efficient interior-point algorithm until recently) uses all good strategies and fails to prove the convergence. Therefore, MPC does not have polynomiality, a critical issue with the simplex method. This book discusses recent developments that resolves the dilemma. It has three major parts. The first, including Chapters 1, 2, 3, and 4, presents some of the most important algorithms during the development of the interior-point method around the 1990s, most of them are widely known. The main purpose of this part is to explain the dilemma described above by analyzing these algorithms' polynomial bounds and summarizing the computational experience associated with them. The second part, including Chapters 5, 6, 7, and 8, describes how to solve the dilemma step-by-step using arc-search techniques. At the end of this part, a very efficient algorithm with the lowest polynomial bound is presented. The last part, including Chapters 9, 10, 11, and 12, extends arc-search techniques to some more general problems, such as convex quadratic programming, linear complementarity problem, and semi-definite programming.