The book discusses three classes of problems: the generalized Nash equilibrium problems, the bilevel problems and the mathematical programming with equilibrium constraints (MPEC). These problems interact through their mathematical analysis as well as their applications. The primary aim of the book is to present the modern tool of variational analysis and optimization, which are used to analyze these three classes of problems. All contributing authors are respected academicians, scientists and researchers from around the globe. These contributions are based on the lectures delivered by experts at CIMPA School, held at the University of Delhi, India, from 25 November-6 December 2013, and peer-reviewed by international experts. The book contains five chapters. Chapter 1 deals with nonsmooth, nonconvex bilevel optimization problems whose feasible set is described by using the graph of the solution set mapping of a parametric optimization problem. Chapter 2 describes a constraint qualification to MPECs considered as an application of calmness concept of multifunctions and is used to derive M-stationarity conditions for MPEC. Chapter 3 discusses the first- and second-order optimality conditions derived for a special case of a bilevel optimization problem in which the constraint set of the lower level problem is described as a general compact convex set. Chapter 4 concentrates the results of the modelization and analysis of deregulated electricity markets with a focus on auctions and mechanism design. Chapter 5 focuses on optimization approaches called reflection methods for protein conformation determination within the framework of matrix completion. The last chapter (Chap. 6) deals with the single-valuedness of quasimonotone maps by using the concept of single-directionality with a special focus on the case of the normal operator of lower semi-continuous quasiconvex functions.

This book presents new efficient methods for optimization in realistic large-scale, multi-agent systems. These methods do not require the agents to have the full information about the system, but instead allow them to make their local decisions based only on the local information, possibly obtained during communication with their local neighbors. The book, primarily aimed at researchers in optimization and control, considers three different information settings in multi-agent systems: oracle-based, communication-based, and payoff-based. For each of these information types, an efficient optimization algorithm is developed, which leads the system to an optimal state. The optimization problems are set without such restrictive assumptions as convexity of the objective functions, complicated communication topologies, closed-form expressions for costs and utilities, and finiteness of the system's state space.

This monograph offers the first systematic account of (metric) regularity theory in variational analysis. It presents new developments alongside classical results and demonstrates the power of the theory through applications to various problems in analysis and optimization theory. The origins of metric regularity theory can be traced back to a series of fundamental ideas and results of nonlinear functional analysis and global analysis centered around problems of existence and stability of solutions of nonlinear equations. In variational analysis, regularity theory goes far beyond the classical setting and is also concerned with non-differentiable and multi-valued operators. The present volume explores all basic aspects of the theory, from the most general problems for mappings between metric spaces to those connected with fairly concrete and important classes of operators acting in Banach and finite dimensional spaces. Written by a leading expert in the field, the book covers new and powerful techniques, which have proven to be highly efficient even in classical settings, and outlines the theory's predominantly quantitative character, leading to a variety of new and unexpected applications. Variational Analysis of Regular Mappings is aimed at graduate students and researchers in nonlinear and functional analysis, especially those working in areas close to optimization and optimal control, and will be suitable to anyone interested in applying new concepts and ideas to operations research, control engineering and numerical analysis.

The contributions in this volume give an insight into current research activities in Shape Optimization, Homogenization and Optimal Control performed in Africa, Germany and internationally. Seeds for collaboration can be found in the first four papers in the field of homogenization. Modelling and optimal control in partial differential equations is the topic of the next six papers, again mixed from Africa and Germany. Finally, new results in the field of shape optimization are discussed in the final international three papers. This workshop, held at the AIMS Center Senegal, March 13-16, 2017, has been supported by the Deutsche Forschungsgemeinschaft (DFG) and by the African Institute for Mathematical Sciences (AIMS) in Senegal, which is one of six centres of a pan-African network of centres of excellence for postgraduate education, research and outreach in mathematical sciences.

This book systematically discusses nonlinear interval optimization design theory and methods. Firstly, adopting a mathematical programming theory perspective, it develops an innovative mathematical transformation model to deal with general nonlinear interval uncertain optimization problems, which is able to equivalently convert complex interval uncertain optimization problems to simple deterministic optimization problems. This model is then used as the basis for various interval uncertain optimization algorithms for engineering applications, which address the low efficiency caused by double-layer nested optimization. Further, the book extends the nonlinear interval optimization theory to design problems associated with multiple optimization objectives, multiple disciplines, and parameter dependence, and establishes the corresponding interval optimization models and solution algorithms. Lastly, it uses the proposed interval uncertain optimization models and methods to deal with practical problems in mechanical engineering and related fields, demonstrating the effectiveness of the models and methods.

The book provides a thorough treatment of set functions, games and capacities as well as integrals with respect to capacities and games, in a mathematical rigorous presentation and in view of application to decision making. After a short chapter introducing some required basic knowledge (linear programming, polyhedra, ordered sets) and notation, the first part of the book consists of three long chapters developing the mathematical aspects. This part is not related to a particular application field and, by its neutral mathematical style, is useful to the widest audience. It gathers many results and notions which are scattered in the literature of various domains (game theory, decision, combinatorial optimization and operations research). The second part consists of three chapters, applying the previous notions in decision making and modelling: decision under uncertainty, decision with multiple criteria, possibility theory and Dempster-Shafer theory.

"Impulsive Control in Continuous and Discrete-Continuous Systems" is an up-to-date introduction to the theory of impulsive control in nonlinear systems. This is a new branch of the Optimal Control Theory, which is tightly connected to the Theory of Hybrid Systems. The text introduces the reader to the interesting area of optimal control problems with discontinuous solutions, discussing the application of a new and effective method of discontinuous time-transformation. With a large number of examples, illustrations, and applied problems arising in the area of observation control, this book is excellent as a textbook or reference for a senior or graduate-level course on the subject, as well as a reference for researchers in related fields.

This book provides a handy, unified introduction to the theory of compact extended formulations of exponential-size integer linear programming (ILP) models. Compact extended formulations are equally powerful, but polynomial-sized, models whose solutions do not require the implementation of separation and pricing procedures. The book is written in a general, didactic form, first developing the background theoretical concepts (polyhedra, projections, linear and integer programming) and then delving into the various techniques for compact extended reformulations. The techniques are illustrated through a wealth of examples touching on many application areas, such as classical combinatorial optimization, network design, timetabling, scheduling, routing, computational biology and bioinformatics. The book is intended for graduate or PhD students - either as an advanced course on selected topics or within a more general course on ILP and mathematical programming - as well as for practitioners and software engineers in industry exploring techniques for developing optimization models for their specific problems.

This text covers the basic theory and computation for mathematical modeling in linear programming. It provides a strong background on how to set up mathematical proofs and high-level computation methods, and includes substantial background material and direction. Paris presents an intuitive and novel discussion of what it means to solve a system of equations that is a crucial stepping stone for solving any linear program. The discussion of the simplex method for solving linear programs gives an economic interpretation to every step of the simplex algorithm. The text combines in a unique and novel way the microeconomics of production with the structure of linear programming to give students and scholars of economics a clear notion of what it means, formulating a model of economic equilibrium and the computation of opportunity cost in the presence of many outputs and inputs.

Two approaches are known for solving large-scale unconstrained optimization problems-the limited-memory quasi-Newton method (truncated Newton method) and the conjugate gradient method. This is the first book to detail conjugate gradient methods, showing their properties and convergence characteristics as well as their performance in solving large-scale unconstrained optimization problems and applications. Comparisons to the limited-memory and truncated Newton methods are also discussed. Topics studied in detail include: linear conjugate gradient methods, standard conjugate gradient methods, acceleration of conjugate gradient methods, hybrid, modifications of the standard scheme, memoryless BFGS preconditioned, and three-term. Other conjugate gradient methods with clustering the eigenvalues or with the minimization of the condition number of the iteration matrix, are also treated. For each method, the convergence analysis, the computational performances and the comparisons versus other conjugate gradient methods are given. The theory behind the conjugate gradient algorithms presented as a methodology is developed with a clear, rigorous, and friendly exposition; the reader will gain an understanding of their properties and their convergence and will learn to develop and prove the convergence of his/her own methods. Numerous numerical studies are supplied with comparisons and comments on the behavior of conjugate gradient algorithms for solving a collection of 800 unconstrained optimization problems of different structures and complexities with the number of variables in the range [1000,10000]. The book is addressed to all those interested in developing and using new advanced techniques for solving unconstrained optimization complex problems. Mathematical programming researchers, theoreticians and practitioners in operations research, practitioners in engineering and industry researchers, as well as graduate students in mathematics, Ph.D. and master students in mathematical programming, will find plenty of information and practical applications for solving large-scale unconstrained optimization problems and applications by conjugate gradient methods.

This Palgrave Pivot presents tournament design mainly within the axioms of incentive compatibility and fairness. It illustrates the advantages of an axiomatic approach through various examples, including several FIFA and UEFA tournaments, and uses theoretical tools and simulation methodology in its analysis. Chapter 1 discusses scoring systems of championships with multiple competitions, ranking in Swiss-system tournaments, and tie-breaking rules in round-robin leagues. It is followed by a thorough critical analysis of the current and previous FIFA World Rankings. The broad focus is substantially narrowed in Chapter 2, which turns to the topic of incentive (in)compatibility in multiple qualifiers. It is revealed that UEFA has faced at least three times recently this problem in the qualification to the UEFA Europa League, qualification to the UEFA Champions League, and the draw of the UEFA Champions League groups. Analogously, Chapter 3 discusses incentive (in)compatibility when there is only one group-based tournament but the complex progression rules to the subsequent stage can be designed poorly. Our examples include the qualifying tournaments of recent FIFA World Cups and UEFA European Championships. Chapter 4 moves to the problem of penalty shootout rules in soccer, where the fairness and complexity of some alternative mechanisms from the literature are evaluated. Fairness remains the central issue in Chapter 5, which presents the challenges of designing a tournament with 24 teams if the number of teams per group cannot exceed four. As expected, there is no perfect solution, and both FIFA and UEFA have introduced a reform in this format recently. Chapter 6 deals with the qualification for the 2020 UEFA European Football Championship. Its tournament design is perhaps the most complicated one that has ever been implemented in the real-world and suffers from serious shortcomings.

This book provides a state-of-the-art overview on the dynamics and coevolution in multi-level strategic interaction games. As such it summarizes the results of the European CONGAS project, which developed new mathematical models and tools for the analysis, prediction and control of dynamical processes in systems possessing a rich multi-level structure and a web of interwoven interactions among elements with autonomous decision-making capabilities. The framework is built around game theoretical concepts, in particular evolutionary and multi-resolution games, and includes also techniques drawn from graph theory, statistical mechanics, control and optimization theory. Specific attention is devoted to systems that are prone to intermittency and catastrophic events due to the effect of collective dynamics.

This book presents a structured approach to formulate, model, and solve mathematical optimization problems for a wide range of real world situations. Among the problems covered are production, distribution and supply chain planning, scheduling, vehicle routing, as well as cutting stock, packing, and nesting. The optimization techniques used to solve the problems are primarily linear, mixed-integer linear, nonlinear, and mixed integer nonlinear programming. The book also covers important considerations for solving real-world optimization problems, such as dealing with valid inequalities and symmetry during the modeling phase, but also data interfacing and visualization of results in a more and more digitized world. The broad range of ideas and approaches presented helps the reader to learn how to model a variety of problems from process industry, paper and metals industry, the energy sector, and logistics using mathematical optimization techniques.

This book contains extended, in-depth presentations of the plenary talks from the 16th French-German-Polish Conference on Optimization, held in Krakow, Poland in 2013. Each chapter in this book exhibits a comprehensive look at new theoretical and/or application-oriented results in mathematical modeling, optimization, and optimal control. Students and researchers involved in image processing, partial differential inclusions, shape optimization, or optimal control theory and its applications to medical and rehabilitation technology, will find this book valuable. The first chapter by Martin Burger provides an overview of recent developments related to Bregman distances, which is an important tool in inverse problems and image processing. The chapter by Piotr Kalita studies the operator version of a first order in time partial differential inclusion and its time discretization. In the chapter by Gunter Leugering, Jan Sokolowski and Antoni Zochowski, nonsmooth shape optimization problems for variational inequalities are considered. The next chapter, by Katja Mombaur is devoted to applications of optimal control and inverse optimal control in the field of medical and rehabilitation technology, in particular in human movement analysis, therapy and improvement by means of medical devices. The final chapter, by Nikolai Osmolovskii and Helmut Maurer provides a survey on no-gap second order optimality conditions in the calculus of variations and optimal control, and a discussion of their further development.

This book introduces the reader to the field of multiobjective optimization through problems with simple structures, namely those in which the objective function and constraints are linear. Fundamental notions as well as state-of-the-art advances are presented in a comprehensive way and illustrated with the help of numerous examples. Three of the most popular methods for solving multiobjective linear problems are explained, and exercises are provided at the end of each chapter, helping students to grasp and apply key concepts and methods to more complex problems. The book was motivated by the fact that the majority of the practical problems we encounter in management science, engineering or operations research involve conflicting criteria and therefore it is more convenient to formulate them as multicriteria optimization models, the solution concepts and methods of which cannot be treated using traditional mathematical programming approaches.

This book is a comprehensive introduction of the reader into the simulation and modelling techniques and their application in the management of organisations. The book is rooted in the thorough understanding of systems theory applied to organisations and focuses on how this theory can apply to econometric models used in the management of organisations. The econometric models in this book employ linear and dynamic programming, graph theory, queuing theory, game theory, etc. and are presented and analysed in various fields of application, such as investment management, stock management, strategic decision making, management of production costs and the lifecycle costs of quality and non-quality products, production quality Management, etc.

This book introduces a new paradigm called 'Optimization in Changeable Spaces' (OCS) as a useful tool for decision making and problem solving. It illustrates how OCS incorporates, searches, and constructively restructures the parameters, tangible and intangible, involved in the process of decision making. The book elaborates on OCS problems that can be modeled and solved effectively by using the concepts of competence set analysis, Habitual Domain (HD) and the mental operators called the 7-8-9 principles of deep knowledge of HD. In addition, new concepts of covering and discovering processes are proposed and formulated as mathematical tools to solve OCS problems. The book also includes reformulations of a number of illustrative real-life challenging problems that cannot be solved by traditional optimization techniques into OCS problems, and details how they can be addressed. Beyond that, it also includes perspectives related to innovation dynamics, management, artificial intelligence, artificial and e-economics, scientific discovery and knowledge extraction. This book will be of interest to managers of businesses and institutions, policy makers, and educators and students of decision making and behavior in DBA and/or MBA.

The popularity of smart phones and other mobile devices has brought about major expansion in the realm of wireless communications. With this growth comes the need to improve upon network capacity and overall user experience, and game-based methods can offer further enhancements in this area. Game Theory Framework Applied to Wireless Communication Networks is a pivotal reference source for the latest scholarly research on the application of game-theoretic approaches to enhance wireless networking. Featuring prevailing coverage on a range of topics relating to the advanced game model, mechanism designs, and effective equilibrium concepts, this publication is an essential reference source for researchers, students, technology developers, and engineers. This publication features extensive, research-based chapters across a broad scope of relevant topics, including potential games, coalition formation game, heterogeneous networks, radio resource allocation, coverage optimization, distributed dynamic resource allocation, dynamic spectrum access, physical layer security, and cooperative video transmission.

This book presents the basics of linear and nonlinear optimization analysis for both single and multi-objective problems in hydrosystem engineering. The book includes several examples with various levels of complexity in different fields of water resources engineering. The examples are solved step by step to assist the reader and to make it easier to understand the concepts. In addition, the latest tools and methods are presented to help students, researchers, engineers and water managers to properly conceptualize and formulate resource allocation problems, and to deal with the complexity of constraints in water demand and available supplies in an appropriate way. "

The series is designed to bring together those mathematicians who are seriously interested in getting new challenging stimuli from economic theories with those economists who are seeking effective mathematical tools for their research. A lot of economic problems can be formulated as constrained optimizations and equilibration of their solutions. Various mathematical theories have been supplying economists with indispensable machineries for these problems arising in economic theory. Conversely, mathematicians have been stimulated by various mathematical difficulties raised by economic theories.

This book reviews the state-of-the-art developments in nature-inspired algorithms and their applications in various disciplines, ranging from feature selection and engineering design optimization to scheduling and vehicle routing. It introduces each algorithm and its implementation with case studies as well as extensive literature reviews, and also includes self-contained chapters featuring theoretical analyses, such as convergence analysis and no-free-lunch theorems so as to provide insights into the current nature-inspired optimization algorithms. Topics include ant colony optimization, the bat algorithm, B-spline curve fitting, cuckoo search, feature selection, economic load dispatch, the firefly algorithm, the flower pollination algorithm, knapsack problem, octonian and quaternion representations, particle swarm optimization, scheduling, wireless networks, vehicle routing with time windows, and maximally different alternatives. This timely book serves as a practical guide and reference resource for students, researchers and professionals.

This book integrates the fundamentals, methodology, and major application fields of noncooperative and cooperative games including conflict resolution. The topics addressed in the book are discrete and continuous games including games represented by finite trees; matrix and bimatrix games as well as oligopolies; cooperative solution concepts; games under uncertainty; dynamic games and conflict resolution. The methodology is illustrated by carefully chosen examples, applications and case studies which are selected from economics, social sciences, engineering, the military and homeland security. This book is highly recommended to readers who are interested in the in-depth and up-to-date integration of the theory and ever-expanding application areas of game theory.

This book primarily addresses various game theory phenomena in the context of management practice. As such, it helps readers identify the profound game theory principles behind these phenomena. At the same time, the game theory principles in the book can also provide a degree of guidance for solving practical problems.As one of the main areas in management research, there is already an extensive body of literature on game theory. However, it remains mainly theoretical, focusing on abstract arguments and purely numerical examples purely. This book addresses that gap, helping readers apply game theory in their actual management or research work.

This book presents the state-of-the-art in non-linear dynamics and sunspots. These two topics have been the core of an international conference on instability and public policies in a globalized world, organized at Aix-Marseille School of Economics and GREQAM in honor of Jean-Michel Grandmont. He has made significant contributions on general equilibrium theory, monetary theory, learning, aggregation, non-linear dynamics and sunspots. This book assembles contributions by Jean-Michel Grandmont's colleagues, students and friends that have been influenced by his works and that are at the frontier of research in this domain today.