In a world with highly competitive markets and economic instability due to capitalization, industrial competition has increasingly intensified. In order for many industries to survive and succeed, they need to develop highly effective coordination between supply chain partners, dynamic collaborative and strategic alliance relationships, and efficient logistics and supply chain network designs. Consequently, in the past decade, there has been an explosion of interest among academic researchers and industrial practitioners in innovative supply chain and logistics models, algorithms, and coordination policies. Mathematically distinct from classical supply chain management, this emerging research area has been proven to be useful and applicable to a wide variety of industries. This book brings together recent advances in supply chain and logistics research and computational optimization that apply to a collaborative environment in the enterprise.

This proceedings volume, the fifth in a series from the Combinatorial and Additive Number Theory (CANT) conferences, is based on talks from the 19th annual workshop, held online due to the COVID-19 pandemic. Organized every year since 2003 by the New York Number Theory Seminar at the CUNY Graduate Center, the workshops survey state-of-the-art open problems in combinatorial and additive number theory and related parts of mathematics. The CANT 2021 meeting featured over a hundred speakers from North and South America, Europe, Asia, Australia, and New Zealand, and was the largest CANT conference in terms of the number of both lectures and participants. These proceedings contain peer-reviewed and edited papers on current topics in number theory. Topics featured in this volume include sumsets, minimal bases, Sidon sets, analytic and prime number theory, combinatorial and discrete geometry, numerical semigroups, and a survey of expansion, divisibility, and parity. This selection of articles will be of relevance to both researchers and graduate students interested in current progress in number theory.

Bayesian decision theory is known to provide an effective framework for the practical solution of discrete and nonconvex optimization problems. This book is the first to demonstrate that this framework is also well suited for the exploitation of heuristic methods in the solution of such problems, especially those of large scale for which exact optimization approaches can be prohibitively costly. The book covers all aspects ranging from the formal presentation of the Bayesian Approach, to its extension to the Bayesian Heuristic Strategy, and its utilization within the informal, interactive Dynamic Visualization strategy. The developed framework is applied in forecasting, in neural network optimization, and in a large number of discrete and continuous optimization problems. Specific application areas which are discussed include scheduling and visualization problems in chemical engineering, manufacturing process control, and epidemiology. Computational results and comparisons with a broad range of test examples are presented. The software required for implementation of the Bayesian Heuristic Approach is included. Although some knowledge of mathematical statistics is necessary in order to fathom the theoretical aspects of the development, no specialized mathematical knowledge is required to understand the application of the approach or to utilize the software which is provided. Audience: The book is of interest to both researchers in operations research, systems engineering, and optimization methods, as well as applications specialists concerned with the solution of large scale discrete and/or nonconvex optimization problems in a broad range of engineering and technological fields. It may be used as supplementary material for graduate level courses.

This text provides the undergraduate chemical engineering student with the necessary tools for problem solving in chemical or bio-engineering processes. In a friendly, simple, and unified framework, the exposition aptly balances theory and practice. It uses minimal mathematical concepts, terms, algorithms, and describes the main aspects of chemical process optimization using MATLAB and GAMS. Numerous examples and case studies are designed for students to understand basic principles of each optimization method and elicit the immediate discovery of practical applications. Problem sets are directly tied to real-world situations most commonly encountered in chemical engineering applications. Chapters are structured with handy learning summaries, terms and concepts, and problem sets, and individually reinforce the basics of particular optimization methods. Additionally, the wide breadth of topics that may be encountered in courses such as Chemical Process Optimization, Chemical Process Engineering, Optimization of Chemical Processes, are covered in this accessible text. The book provides formal introductions to MATLAB, GAMS, and a revisit to pertinent aspects of undergraduate calculus. While created for coursework, this text is also suitable for independent study. A full solutions manual is available to instructors who adopt the text for their course.

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 covers central issues in mitigating supply chain risks from various perspectives. Today's supply chains are vulnerable to disruptions that can have a significant impact on firms, business and performance. The aim of supply chain risk management is to identify the potential sources of risks and implement appropriate actions in order to mitigate supply chain disruptions. In this regard, the book presents a wealth of methods, strategies and analyses that are essential for mitigating supply chain risks. As a comprehensive collection of the latest research and cutting-edge developments in supply chain risk and its mitigation, the book is structured into four main parts, addressing supply chain risk strategies and developments; supply chain risk management review; supply chain sustainability and resilience; and supply chain analysis and risk management applications. The contributing authors are leading academic researchers and practitioners, who combine findings and research results with a practical and contemporary view on how companies can best manage supply chain risks and disruptions, as well as how to create resilient and sustainable supply chains. This book can be used as an essential resource for students and scholars who are interested in pursuing research or teaching courses on the rapidly growing field of supply chain management. It also offers an interesting and informative read for managers and practitioners who need to deepen their understanding of effective supply chain risk management.

This book contains select papers presented at the 3rd International Conference on Engineering Mathematics and Computing (ICEMC 2020), held at the Haldia Institute of Technology, Purba Midnapur, West Bengal, India, from 5-7 February 2020. The book discusses new developments and advances in the areas of neural networks, connectionist systems, genetic algorithms, evolutionary computation, artificial intelligence, cellular automata, self-organizing systems, soft computing, fuzzy systems, hybrid intelligent systems, etc. The book, containing 19 chapters, is useful to the researchers, scholars, and practising engineers as well as graduate students of engineering and applied sciences.

Features Provides a uniquely historical perspective on the mathematical underpinnings of a comprehensive list of games Suitable for a broad audience of differing mathematical levels. Anyone with a passion for games, game theory, and mathematics will enjoy this book, whether they be students, academics, or game enthusiasts Covers a wide selection of topics at a level that can be appreciated on a historical, recreational, and mathematical level.

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.

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 monograph explores a dual variational formulation of solutions to nonlinear diffusion equations with general nonlinearities as null minimizers of appropriate energy functionals. The author demonstrates how this method can be utilized as a convenient tool for proving the existence of these solutions when others may fail, such as in cases of evolution equations with nonautonomous operators, with low regular data, or with singular diffusion coefficients. By reducing it to a minimization problem, the original problem is transformed into an optimal control problem with a linear state equation. This procedure simplifies the proof of the existence of minimizers and, in particular, the determination of the first-order conditions of optimality. The dual variational formulation is illustrated in the text with specific diffusion equations that have general nonlinearities provided by potentials having various stronger or weaker properties. These equations can represent mathematical models to various real-world physical processes. Inverse problems and optimal control problems are also considered, as this technique is useful in their treatment as well.

This volume highlights contributions of women mathematicians in the study of complex materials and includes both original research papers and reviews. The featured topics and methods draw on the fields of Calculus of Variations, Partial Differential Equations, Functional Analysis, Differential Geometry and Topology, as well as Numerical Analysis and Mathematical Modelling. Areas of applications include foams, fluid-solid interactions, liquid crystals, shape-memory alloys, magnetic suspensions, failure in solids, plasticity, viscoelasticity, homogenization, crystallization, grain growth, and phase-field models.

This book is a rigorous but practical presentation of the techniques of uncertainty quantification, with applications in R and Python. This volume includes mathematical arguments at the level necessary to make the presentation rigorous and the assumptions clearly established, while maintaining a focus on practical applications of uncertainty quantification methods. Practical aspects of applied probability are also discussed, making the content accessible to students. The introduction of R and Python allows the reader to solve more complex problems involving a more significant number of variables. Users will be able to use examples laid out in the text to solve medium-sized problems. The list of topics covered in this volume includes linear and nonlinear programming, Lagrange multipliers (for sensitivity), multi-objective optimization, game theory, as well as linear algebraic equations, and probability and statistics. Blending theoretical rigor and practical applications, this volume will be of interest to professionals, researchers, graduate and undergraduate students interested in the use of uncertainty quantification techniques within the framework of operations research and mathematical programming, for applications in management and planning.

In the last few years, Algorithms for Convex Optimization have revolutionized algorithm design, both for discrete and continuous optimization problems. For problems like maximum flow, maximum matching, and submodular function minimization, the fastest algorithms involve essential methods such as gradient descent, mirror descent, interior point methods, and ellipsoid methods. The goal of this self-contained book is to enable researchers and professionals in computer science, data science, and machine learning to gain an in-depth understanding of these algorithms. The text emphasizes how to derive key algorithms for convex optimization from first principles and how to establish precise running time bounds. This modern text explains the success of these algorithms in problems of discrete optimization, as well as how these methods have significantly pushed the state of the art of convex optimization itself.

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.

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.

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

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.

This is an open access book discusses readers to various methods of modeling plans and policies that address public sector issues and problems. Written for public policy and social sciences students at the upper undergraduate and graduate level, as well as public sector decision-makers, it demonstrates and compares the development and use of various deterministic and probabilistic optimization and simulation modeling methods for analyzing planning and management issues. These modeling tools offer a means of identifying and evaluating alternative plans and policies based on their physical, economic, environmental, and social impacts. Learning how to develop and use the mathematical modeling tools introduced in this book will give students useful skills when in positions of having to make informed public policy recommendations or decisions.

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 is devoted to the study of two large classes of discrete-time optimal control problems arising in mathematical economics. Nonautonomous optimal control problems of the first class are determined by a sequence of objective functions and sequence of constraint maps. They correspond to a general model of economic growth. We are interested in turnpike properties of approximate solutions and in the stability of the turnpike phenomenon under small perturbations of objective functions and constraint maps. The second class of autonomous optimal control problems corresponds to another general class of models of economic dynamics which includes the Robinson-Solow-Srinivasan model as a particular case. In Chap. 1 we discuss turnpike properties for a large class of discrete-time optimal control problems studied in the literature and for the Robinson-Solow-Srinivasan model. In Chap. 2 we introduce the first class of optimal control problems and study its turnpike property. This class of problems is also discussed in Chaps. 3-6. In Chap. 3 we study the stability of the turnpike phenomenon under small perturbations of the objective functions. Analogous results for problems with discounting are considered in Chap. 4. In Chap. 5 we study the stability of the turnpike phenomenon under small perturbations of the objective functions and the constraint maps. Analogous results for problems with discounting are established in Chap. 6. The results of Chaps. 5 and 6 are new. The second class of problems is studied in Chaps. 7-9. In Chap. 7 we study the turnpike properties. The stability of the turnpike phenomenon under small perturbations of the objective functions is established in Chap. 8. In Chap. 9 we establish the stability of the turnpike phenomenon under small perturbations of the objective functions and the constraint maps. The results of Chaps. 8 and 9 are new. In Chap. 10 we study optimal control problems related to a model of knowledge-based endogenous economic growth and show the existence of trajectories of unbounded economic growth and provide estimates for the growth rate.

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

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