The effectiveness of the algorithms of linear programming in solving problems is largely dependent upon the particular applications from which these problems arise. A first course in linear programming should not only allow one to solve many different types of problems in many different contexts but should provide deeper insights into the fields in which linear programming finds its utility. To this end, the emphasis throughtout Linear Programming and Its Applications is on the acquisition of linear programming skills via the algorithmic solution of small-scale problems both in the general sense and in the specific applications where these problems naturally occur. The first part of the book deals with methods to solve general linear programming problems and discusses the theory of duality which connects these problems. The second part of the book deals with linear programming in different applications including the fields of game theory and graph theory as well as the more traditional transportation and assignment problems. The book is versatile; in as much as Linear Programming and Its Applications is intended to be used as a first course in linear programming, it is suitable for students in such varying fields as mathematics, computer science, engineering, actuarial science, and economics.

This book collects chapters on contemporary topics on metric fixed point theory and its applications in science, engineering, fractals, and behavioral sciences. Chapters contributed by renowned researchers from across the world, this book includes several useful tools and techniques for the development of skills and expertise in the area. The book presents the study of common fixed points in a generalized metric space and fixed point results with applications in various modular metric spaces. New insight into parametric metric spaces as well as study of variational inequalities and variational control problems have been included.

Special tools are required for examining and solving optimization problems. The main tools in the study of local optimization are classical calculus and its modern generalizions which form nonsmooth analysis. The gradient and various kinds of generalized derivatives allow us to ac complish a local approximation of a given function in a neighbourhood of a given point. This kind of approximation is very useful in the study of local extrema. However, local approximation alone cannot help to solve many problems of global optimization, so there is a clear need to develop special global tools for solving these problems. The simplest and most well-known area of global and simultaneously local optimization is convex programming. The fundamental tool in the study of convex optimization problems is the subgradient, which actu ally plays both a local and global role. First, a subgradient of a convex function f at a point x carries out a local approximation of f in a neigh bourhood of x. Second, the subgradient permits the construction of an affine function, which does not exceed f over the entire space and coincides with f at x. This affine function h is called a support func tion. Since f(y) ~ h(y) for ally, the second role is global. In contrast to a local approximation, the function h will be called a global affine support.

This book presents the theory of Industrial Organization in a unified and concise way. It presents the main models and results in the area, using game theory as a unifying theoretical background. Besides corrections and new sections, the new edition contains a new chapter on games of incomplete information. More than 200 excercises help the reader to understand the results of the book.

We always come cross several decision-making problems in our daily life. Such problems are always conflicting in which many different view points should be satisfied. In politics, business, industrial systems, management science, networks, etc. one often encounters such kind of problems. The most important and difficult part in such problems is the conflict between various objectives and goals. In these problems, one has to find the minimum(or maximum) for several objective functions. Such problems are called vector optimization problems (VOP),multi-criteria optimization problems or multi-objective optimization problems. This volume deals with several different topics / aspects of vector optimization theory ranging from the very beginning to the most recent one. It contains fourteen chapters written by different experts in the field of vector optimization.

Many books on optimization consider only finite dimensional spaces. This volume is unique in its emphasis: the first three chapters develop optimization in spaces without linear structure, and the analog of convex analysis is constructed for this case. Many new results have been proved specially for this publication. In the following chapters optimization in infinite topological and normed vector spaces is considered. The novelty consists in using the drop property for weak well-posedness of linear problems in Banach spaces and in a unified approach (by means of the Dolecki approximation) to necessary conditions of optimality. The method of reduction of constraints for sufficient conditions of optimality is presented. The book contains an introduction to non-differentiable and vector optimization. Audience: This volume will be of interest to mathematicians, engineers, and economists working in mathematical optimization.

The study of the theory of games was started in Von Neumann (1928), but the development of the theory of games was accelerated after the publication of the classical book "Theory of games and economic behavior" by Von Neumann and Morgenstern (1944). As an initial step, the theory of games aims to put situations of conflict and cooperation into mathematical models. In the second and final step, the resulting models are analysed on the basis of equitable and mathematical reasonings. The conflict and/or cooperative situation in question is generally due to the interaction between two or more individuals (players). Their interaction may lead up to several potential payoffs over which each player has his own preferences. Any player attempts to achieve his largest possible payoff, but the other players may also exert their influence on the realization of some potential payoff. As already mentioned, the theory of games consists of two parts, a modelling part and a solution part. Concerning the modelling part, the mathematical models of conflict and cooperative situations are described. The description of the models includes the rules, the strategy space of any player, potential payoffs to the players, the preferences of each player over the set of all potential payoffs, etc. According to the rules, it is either permitted or forbidden that the players communicate with one another in order to make binding agreements regarding their mutual actions.

This book introduces the advances in synchromodal logistics and provides a framework to classify various optimisation problems in this field. It explores the application of this framework to solve a broad range of problems, such as problems with and without a central decision-maker, problems with and without full information, deterministic problems, problems coping with uncertainty, optimisation of a full network design problem. It covers theoretical constructs, such as discrete optimisation, robust optimisation, optimisation under uncertainty, multi-objective optimisation and agent based equilibrium models. Moreover, practical elaborated use cases are presented to deepen understanding. The book gives both researchers and practitioners a good overview of the field of synchromodal optimisation problems and offers the reader practical methods for modelling and problem-solving.

This book presents and uses a major, new database of the most serious forms of internal resistance to the Nazi state to study empirically the whole phenomenon of resistance to an authoritarian regime. By studying serious political resistance from a quantitative historical perspective, the book opens up a new avenue of research for economic history. The database underpinning the book was painstakingly compiled from official state records of treason and/or high treason tried before the German People's Court (Volksgerichtshof) between 1933 and 1945. It brings together material on resistance groups stored in the archives of the Federal Republic of Germany and Austria with previously inaccessible files from the former German Democratic Republic, Czechoslovakia and Soviet Union. Through searching these records, the authors have been able to reconstruct in hitherto unattainable detail the economic, social, political, ethnic and familial profiles, backgroun ds, and influences of all 4,378 civilians of the Third Reich active in Germany, Austria and the outside territories for whom there are complete records. The findings of their research afford fresh, new interdisciplinary insights and perspectives, not only on the configuration, timing, impact and profile of resistance to the Nazi state, but also on a range of real-world behaviours common within authoritarian states, such as defection, reward and punishment, and commitment to group identities. The book's statistical analysis reveals precisely the who, how, where and when of serious resistance. In so doing, it advances significantly our understanding of the overall pattern and nature of serious resistance within Nazi Germany.

Using numerical examples to illustrate their concepts and results, this book examines recently developed fuzzy multi-criteria methods, such as Intuitionistic Fuzzy TOPSIS, Intuitionistic Fuzzy TOPSIS & DEA-AHP, Intuitionistic VIKOR, Pythagorean WASPAS, Pythagorean ENTROPI, Hesitant CBD, Hesitant MABAC, Triangular EDAS, Triangular PROMETHEE, q-Rung Orthopair COPRAS, and Fuzzy Type - 2 ELECTRE. Each chapter covers practical applications in addition to fresh developments and results. Given its structure and scope, the book can be used as a textbook in graduate courses on operations research and industrial engineering. It also offers a valuable resource for scientists working in a range of disciplines that require multi-criteria decision making.

Give, and it shall be given unto you. ST. LUKE, VI, 38. The book is based on several courses of lectures on control theory and appli cations which were delivered by the authors for a number of years at Moscow Electronics and Mathematics University. The book, originally written in Rus sian, was first published by Vysshaya Shkola (Higher School) Publishing House in Moscow in 1989. In preparing a new edition of the book we planned to make only minor changes in the text. However, we soon realized that we like many scholars working in control theory had learned many new things and had had many new insights into control theory and its applications since the book was first published. Therefore, we rewrote the book especially for the English edition. So, this is substantially a new book with many new topics. The book consists of an introduction and four parts. Part One deals with the fundamentals of modern stability theory: general results concerning stability and instability, sufficient conditions for the stability of linear systems, methods for determining the stability or instability of systems of various type, theorems on stability under random disturbances."

Games, Norms, and Reasons: Logic at the Crossroads provides an overview of modern logic focusing on its relationships with other disciplines, including new interfaces with rational choice theory, epistemology, game theory and informatics. This book continues a series called "Logic at the Crossroads" whose title reflects a view that the deep insights from the classical phase of mathematical logic can form a harmonious mixture with a new, more ambitious research agenda of understanding and enhancing human reasoning and intelligent interaction. The editors have gathered together articles from active authors in this new area that explore dynamic logical aspects of norms, reasons, preferences and beliefs in human agency, human interaction and groups. The book pays a special tribute to Professor Rohit Parikh, a pioneer in this movement.

Focusing on the study of nonsmooth vector functions, this book presents a comprehensive account of the calculus of generalized Jacobian matrices and their applications to continuous nonsmooth optimization problems, as well as variational inequalities in finite dimensions. The treatment is motivated by a desire to expose an elementary approach to nonsmooth calculus, using a set of matrices to replace the nonexistent Jacobian matrix of a continuous vector function.

This book defines and studies a combinatorial object called the pedigree and develops the theory for optimising a linear function over the convex hull of pedigrees (the Pedigree polytope). A strongly polynomial algorithm implementing the framework given in the book for checking membership in the pedigree polytope is a major contribution. This book challenges the popularly held belief in computer science that a problem included in the NP-complete class may not have a polynomial algorithm to solve. By showing STSP has a polynomial algorithm, this book settles the P vs NP question. This book has illustrative examples, figures, and easily accessible proofs for showing this unexpected result. This book introduces novel constructions and ideas previously not used in the literature. Another interesting feature of this book is it uses basic max-flow and linear multicommodity flow algorithms and concepts in these proofs establishing efficient membership checking for the pedigree polytope. Chapters 3-7 can be adopted to give a course on Efficient Combinatorial Optimization. This book is the culmination of the author's research that started in 1982 through a presentation on a new formulation of STSP at the XIth International Symposium on Mathematical Programming at Bonn.

This book addresses and disseminates state-of-the-art research and development of differential evolution (DE) and its recent advances, such as the development of adaptive, self-adaptive and hybrid techniques. Differential evolution is a population-based meta-heuristic technique for global optimization capable of handling non-differentiable, non-linear and multi-modal objective functions. Many advances have been made recently in differential evolution, from theory to applications. This book comprises contributions which include theoretical developments in DE, performance comparisons of DE, hybrid DE approaches, parallel and distributed DE for multi-objective optimization, software implementations, and real-world applications. The book is useful for researchers, practitioners, and students in disciplines such as optimization, heuristics, operations research and natural computing.

This book employs game theory to warfare and in particular to military operations. It aims at scrutinizing the validity of the two ideas that have governed the literature on war and warfighting: One is the Clausewitzian Fog of War, which suggests that he who is able to "see" through the gunsmoke and observe his opponent's moves before he has to commit to some strategy himself, should be able to gain an advantage over that enemy; the other is the tradition of understanding military conflict as a zero-sum game. Combined, these ideas seem to imply that war always gives rise to a second-mover advantage. This book questions the validity of this presumption at the operational level of military planning. It provides a simple but rigorous game-theoretic framework in order to analyse operational alternatives for a whole range of typical conflicts Western military forces are facing, including the most recent ones such as Anti-Access/Area-Denial and supporting host nations' counterinsurgency campaigns.

The focus of this book is on establishing theories and methods of both decision and game analysis in management using intuitionistic fuzzy sets. It proposes a series of innovative theories, models and methods such as the representation theorem and extension principle of intuitionistic fuzzy sets, ranking methods of intuitionistic fuzzy numbers, non-linear and linear programming methods for intuitionistic fuzzy multi-attribute decision making and (interval-valued) intuitionistic fuzzy matrix games. These theories and methods form the theory system of intuitionistic fuzzy decision making and games, which is not only remarkably different from those of the traditional, Bayes and/or fuzzy decision theory but can also provide an effective and efficient tool for solving complex management problems. Since there is a certain degree of inherent hesitancy in real-life management, which cannot always be described by the traditional mathematical methods and/or fuzzy set theory, this book offers an effective approach to using the intuitionistic fuzzy set expressed with membership and non-membership functions. This book is addressed to all those involved in theoretical research and practical applications from a variety of fields/disciplines: decision science, game theory, management science, fuzzy sets, operational research, applied mathematics, systems engineering, industrial engineering, economics, etc.

The field of metaheuristics has been fast evolving in recent years. Techniques such as simulated annealing, tabu search, genetic algorithms, scatter search, greedy randomized adaptive search, variable neighborhood search, ant systems, and their hybrids are currently among the most efficient and robust optimization strategies to find high-quality solutions to many real-life optimization problems. A very large number of successful applications of metaheuristics are reported in the literature and spread throughout many books, journals, and conference proceedings. A series of international conferences entirely devoted to the theory, applications, and computational developments in metaheuristics has been attracting an increasing number of participants, from universities and the industry. Essays and Surveys in Metaheuristics goes beyond the recent conference-oriented volumes in Metaheuristics, with its focus on surveys of recent developments of the main metaheuristics. Well-known specialists have written surveys on the following subjects: simulated annealing (E. Aarts and J. Korst, The Netherlands), noising methods (I. Charon and O. Hudry, France), strategies for the parallel implementation of metaheuristics (V.-D. Cung and C. Roucairol, France, and S.L. Martins and C.C. Ribeiro, Brazil), greedy randomized adaptive search procedures (P. Festa, Italy, and M.G.C. Resende, USA), tabu search (M. Gendreau, Canada), variable neighborhood search (P. Hansen and N. Mladenovic, Canada), ant colonies (V. Maniezzo and A. Carbonaro, Italy), and evolutionary algorithms (H. MA1/4hlenbein and Th. Mahnig, Germany). Several further essays address issues or variants of metaheuristics, as well as innovative orsuccessful applications of metaheuristics to classical or new combinatorial optimization problems.

This book presents a wide range of optimization methods and their applications to various electrical power system problems such as economical load dispatch, demand supply management in microgrids, levelized energy pricing, load frequency control and congestion management, and reactive power management in radial distribution systems. Problems related to electrical power systems are often highly complex due to the massive dimensions, nonlinearity, non-convexity and discontinuity associated with objective functions. These systems also have a large number of equality and inequality constraints, which give rise to optimization problems that are difficult to solve using classical numerical methods. In this regard, nature inspired optimization algorithms offer an effective alternative, due to their ease of use, population-based parallel search mechanism, non-dependence on the nature of the problem, and ability to accommodate non-differentiable, non-convex problems. The analytical model of nature inspired techniques mimics the natural behaviors and intelligence of life forms. These techniques are mainly based on evolution, swarm intelligence, ecology, human intelligence and physical science.

In the last decades, algorithmic advances as well as hardware and software improvements have provided an excellent environment to create and develop solving methods to hard optimization problems. Modern exact and heuristic techniques are dramatically enhancing our ability to solve significant practical problems. This monograph sets out state-of-the-art methodologies for solving combinatorial optimization problems, illustrating them with two well-known problems. This second edition of the book extends the first one by adding to the 'linear ordering problem' (LOP), included in the first edition, the 'maximum diversity problem' (MDP). In this way, we provide the reader with the background, elements and strategies to tackle a wide range of different combinatorial optimization problems. The exact and heuristic techniques outlined in these pages can be put to use in any number of combinatorial optimization problems. While the authors employ the LOP and the MDP to illustrate cutting-edge optimization technologies, the book is also a tutorial on how to design effective and successful implementations of exact and heuristic procedures alike. This monograph provides the basic principles and fundamental ideas that will enable students and practitioners to create valuable applications based on both exact and heuristic technologies. Specifically, it is aimed at engineers, scientists, operations researchers, and other applications specialists who are looking for the most appropriate and recent optimization tools to solve particular problems. The book provides a broad spectrum of advances in search strategies with a focus on its algorithmic and computational aspects.

This original and timely monograph describes a unique self-contained excursion that reveals to the readers the roles of two basic cognitive abilities, i.e. intention recognition and arranging commitments, in the evolution of cooperative behavior. This book analyses intention recognition, an important ability that helps agents predict others behavior, in its artificial intelligence and evolutionary computational modeling aspects, and proposes a novel intention recognition method. Furthermore, the book presents a new framework for intention-based decision making and illustrates several ways in which an ability to recognize intentions of others can enhance a decision making process. By employing the new intention recognition method and the tools of evolutionary game theory, this book introduces computational models demonstrating that intention recognition promotes the emergence of cooperation within populations of self-regarding agents. Finally, the book describes how commitment provides a pathway to the evolution of cooperative behavior, and how it further empowers intention recognition, thereby leading to a combined improved strategy. "

This book contains select chapters on support vector algorithms from different perspectives, including mathematical background, properties of various kernel functions, and several applications. The main focus of this book is on orthogonal kernel functions, and the properties of the classical kernel functions-Chebyshev, Legendre, Gegenbauer, and Jacobi-are reviewed in some chapters. Moreover, the fractional form of these kernel functions is introduced in the same chapters, and for ease of use for these kernel functions, a tutorial on a Python package named ORSVM is presented. The book also exhibits a variety of applications for support vector algorithms, and in addition to the classification, these algorithms along with the introduced kernel functions are utilized for solving ordinary, partial, integro, and fractional differential equations. On the other hand, nowadays, the real-time and big data applications of support vector algorithms are growing. Consequently, the Compute Unified Device Architecture (CUDA) parallelizing the procedure of support vector algorithms based on orthogonal kernel functions is presented. The book sheds light on how to use support vector algorithms based on orthogonal kernel functions in different situations and gives a significant perspective to all machine learning and scientific machine learning researchers all around the world to utilize fractional orthogonal kernel functions in their pattern recognition or scientific computing problems.

This monograph explores the analysis and design of model-free optimal control systems based on reinforcement learning (RL) theory, presenting new methods that overcome recent challenges faced by RL. New developments in the design of sensor data efficient RL algorithms are demonstrated that not only reduce the requirement of sensors by means of output feedback, but also ensure optimality and stability guarantees. A variety of practical challenges are considered, including disturbance rejection, control constraints, and communication delays. Ideas from game theory are incorporated to solve output feedback disturbance rejection problems, and the concepts of low gain feedback control are employed to develop RL controllers that achieve global stability under control constraints. Output Feedback Reinforcement Learning Control for Linear Systems will be a valuable reference for graduate students, control theorists working on optimal control systems, engineers, and applied mathematicians.

Operations Research in Space and Air is a selection of papers reflecting the experience and expertise of international OR consulting companies and academic groups. The global market and competition play a crucial part in the decision making processes within the Space and Air industries and this book gives practical examples of how advanced applications can be used by Space and Air industry management. The material within the book provides both the basic background for the novice modeler and a useful reference for experienced modelers. Students, researchers and OR practitioners will appreciate the details of the modeling techniques, the processes that have been implemented and the computational results that demonstrate the benefits in applying OR in the Space and Airline industries. Advances in PC and Workstations technology, in optimiza tion engines and in modeling techniques now enable solving problems, never before attained by Operations Research. In recent years the Ital ian OR Society (AfRO, www. airo. org) has organized annual forums for researchers and practitioners to meet together to present and dis cuss the various scientific and technical OR achievements. The OR in Space 8 Air session of AfR02001 and AfR02002 Conferences, together with optimization tools' applications, presented recent results achieved by Alenia Spazio S. p. A. (Turin), Alitalia, Milan Polytechnic and Turin Polytechinc. With additional contributions from academia and indus try they have enabled us to capture, in print, today's 'state-of-the-art' optimization and data mining solutions."