This book presents a study of cooperatives as a two-layer entrepreneurial model, and analyzes cooperative enterprises. Above all, it explores how inducements (from the firm) and contributions (from its members, in their respective roles) are aligned, and seeks to answer the question of what this means for managing each cooperative as a firm as well as a group. The book is divided into three parts, the first of which begins with an analysis of specific aspects of cooperative enterprises, with a focus on the added value of cooperation, the weighing of interests, and a behavioral perspective on the imminent communities and their goals. In a structured approach, the book examines the various facets of relationships in cooperatives on a transactional, financial and control level. Further, a case study on the Dutch cooperative Rabobank illustrates what happens when members fail. In turn, part two concentrates on integrating the lessons learned with the existing economic literature on cooperatives, so as to contribute to a theory of cooperative management. Finally, the book links the theoretical approach to practice: in the third part, it reports on the outcomes of using a computerized simulation game to show members of cooperatives how to manage their business and the cooperative business at the same time, enabling them to understand and actively practice two-level entrepreneurship.

This book introduces readers to the background, general framework, main operators, and other basic characteristics of biogeography-based optimization (BBO), which is an emerging branch of bio-inspired computation. In particular, the book presents the authors' recent work on improved variants of BBO, hybridization of BBO with other algorithms, and the application of BBO to a variety of domains including transportation, image processing, and neural network learning. The content will help to advance research into and application of not only BBO but also the whole field of bio-inspired computation. The algorithms and applications are organized in a step-by-step manner and clearly described with the help of pseudo-codes and flowcharts. The readers will learn not only the basic concepts of BBO but also how to apply and adapt the algorithms to the engineering optimization problems they actually encounter.

This book is devoted to a detailed study of the subgradient projection method and its variants for convex optimization problems over the solution sets of common fixed point problems and convex feasibility problems. These optimization problems are investigated to determine good solutions obtained by different versions of the subgradient projection algorithm in the presence of sufficiently small computational errors. The use of selected algorithms is highlighted including the Cimmino type subgradient, the iterative subgradient, and the dynamic string-averaging subgradient. All results presented are new. Optimization problems where the underlying constraints are the solution sets of other problems, frequently occur in applied mathematics. The reader should not miss the section in Chapter 1 which considers some examples arising in the real world applications. The problems discussed have an important impact in optimization theory as well. The book will be useful for researches interested in the optimization theory and its applications.

The 2020 International Conference on Uncertainty Quantification & Optimization gathered together internationally renowned researchers in the fields of optimization and uncertainty quantification. The resulting proceedings cover all related aspects of computational uncertainty management and optimization, with particular emphasis on aerospace engineering problems. The book contributions are organized under four major themes: Applications of Uncertainty in Aerospace & Engineering Imprecise Probability, Theory and Applications Robust and Reliability-Based Design Optimisation in Aerospace Engineering Uncertainty Quantification, Identification and Calibration in Aerospace Models This proceedings volume is useful across disciplines, as it brings the expertise of theoretical and application researchers together in a unified framework.

Advances in discrete mathematics are presented in this book with applications in theoretical mathematics and interdisciplinary research. Each chapter presents new methods and techniques by leading experts. Unifying interdisciplinary applications, problems, and approaches of discrete mathematics, this book connects topics in graph theory, combinatorics, number theory, cryptography, dynamical systems, finance, optimization, and game theory. Graduate students and researchers in optimization, mathematics, computer science, economics, and physics will find the wide range of interdisciplinary topics, methods, and applications covered in this book engaging and useful.

Branches of mathematics and advanced mathematical algorithms can help solve daily problems throughout various fields of applied sciences. Domains like economics, mechanical engineering, and multi-person decision making benefit from the inclusion of mathematics to maximize utility and cooperation across disciplines. There is a need for studies seeking to understand the theories and practice of using differential mathematics to increase efficiency and order in the modern world. Emerging Applications of Differential Equations and Game Theory is a collection of innovative research that examines the recent advancements on interdisciplinary areas of applied mathematics. While highlighting topics such as artificial neuron networks, stochastic optimization, and dynamical systems, this publication is ideally designed for engineers, cryptologists, economists, computer scientists, business managers, mathematicians, mechanics, academicians, researchers, and students.

This is a comprehensive study of various time-dependent scheduling problems in single-, parallel- and dedicated-machine environments. In addition to complexity issues and exact or heuristic algorithms which are typically presented in scheduling books, the author also includes more advanced topics such as matrix methods in time-dependent scheduling, time-dependent scheduling with two criteria and time-dependent two-agent scheduling. The reader should be familiar with the basic notions of calculus, discrete mathematics and combinatorial optimization theory, while the book offers introductory material on theory of algorithms, NP-complete problems, and the basics of scheduling theory. The author includes numerous examples, figures and tables, he presents different classes of algorithms using pseudocode, he completes all chapters with extensive bibliographies, and he closes the book with comprehensive symbol and subject indexes. The previous edition of the book focused on computational complexity of time-dependent scheduling problems. In this edition, the author concentrates on models of time-dependent job processing times and algorithms for solving time-dependent scheduling problems. The book is suitable for researchers working on scheduling, problem complexity, optimization, heuristics and local search algorithms.

The research and review papers presented in this volume provide an overview of the main issues, findings, and open questions in cutting-edge research on the fields of modeling, optimization and dynamics and their applications to biology, economics, energy, finance, industry, physics and psychology. Given the scientific relevance of the innovative applications and emerging issues they address, the contributions to this volume, written by some of the world's leading experts in mathematics, economics and other applied sciences, will be seminal to future research developments and will spark future works and collaborations. The majority of the papers presented in this volume were written by participants of the 4th International Conference on Dynamics, Games and Science: Decision Models in a Complex Economy (DGS IV), held at the National Distance Education University (UNED) in Madrid, Spain in June 2016 and of the 8th Berkeley Bioeconomy Conference: The Future of Biofuels, held at the UC Berkeley Alumni House in April 2015.

This book provides energy efficiency quantitative analysis and optimal methods for discrete manufacturing systems from the perspective of global optimization. In order to analyze and optimize energy efficiency for discrete manufacturing systems, it uses real-time access to energy consumption information and models of the energy consumption, and constructs an energy efficiency quantitative index system. Based on the rough set and analytic hierarchy process, it also proposes a principal component quantitative analysis and a combined energy efficiency quantitative analysis. In turn, the book addresses the design and development of quantitative analysis systems. To save energy consumption on the basis of energy efficiency analysis, it presents several optimal control strategies, including one for single-machine equipment, an integrated approach based on RWA-MOPSO, and one for production energy efficiency based on a teaching and learning optimal algorithm. Given its scope, the book offers a valuable guide for students, teachers, engineers and researchers in the field of discrete manufacturing systems.

This book serves as an introductory text to optimization theory in normed spaces and covers all areas of nonlinear optimization. It presents fundamentals with particular emphasis on the application to problems in the calculus of variations, approximation and optimal control theory. The reader is expected to have a basic knowledge of linear functional analysis.

This tutorial is the first comprehensive introduction to (possibly infinite) linear systems containing strict inequalities and evenly convex sets. The book introduces their application to convex optimization. Particular attention is paid to evenly convex polyhedra and finite linear systems containing strict inequalities. The book also analyzes evenly convex and quasiconvex functions from a conjugacy and duality perspective. It discusses the applications of these functions in economics. Written in an expository style the main concepts and basic results are illustrated with suitable examples and figures..

Data-driven discovery is revolutionizing how we model, predict, and control complex systems. Now with Python and MATLAB (R), this textbook trains mathematical scientists and engineers for the next generation of scientific discovery by offering a broad overview of the growing intersection of data-driven methods, machine learning, applied optimization, and classical fields of engineering mathematics and mathematical physics. With a focus on integrating dynamical systems modeling and control with modern methods in applied machine learning, this text includes methods that were chosen for their relevance, simplicity, and generality. Topics range from introductory to research-level material, making it accessible to advanced undergraduate and beginning graduate students from the engineering and physical sciences. The second edition features new chapters on reinforcement learning and physics-informed machine learning, significant new sections throughout, and chapter exercises. Online supplementary material - including lecture videos per section, homeworks, data, and code in MATLAB (R), Python, Julia, and R - available on databookuw.com.

This book presents the best papers from the 2nd International Conference on Mathematical Research for Blockchain Economy (MARBLE) 2020, held in Vilamoura, Portugal. While most blockchain conferences and forums are dedicated to business applications, product development or Initial Coin Offering (ICO) launches, this conference focused on the mathematics behind blockchain to bridge the gap between practice and theory. Blockchain Technology has been considered as the most fundamental and revolutionising invention since the Internet. Every year, thousands of blockchain projects are launched and circulated in the market, and there is a tremendous wealth of blockchain applications, from finance to healthcare, education, media, logistics and more. However, due to theoretical and technical barriers, most of these applications are impractical for use in a real-world business context. The papers in this book reveal the challenges and limitations, such as scalability, latency, privacy and security, and showcase solutions and developments to overcome them.

This book presents an authoritative collection of contributions reporting on fuzzy logic and decision theory, together with applications and case studies in economics and management science. Dedicated to Professor Jaume Gil Aluja in recognition of his pioneering work, the book reports on theories, methods and new challenges, thus offering not only a timely reference guide but also a source of new ideas and inspirations for graduate students and researchers alike.

This book is devoted to problems of stochastic control and stopping that are time inconsistent in the sense that they do not admit a Bellman optimality principle. These problems are cast in a game-theoretic framework, with the focus on subgame-perfect Nash equilibrium strategies. The general theory is illustrated with a number of finance applications.In dynamic choice problems, time inconsistency is the rule rather than the exception. Indeed, as Robert H. Strotz pointed out in his seminal 1955 paper, relaxing the widely used ad hoc assumption of exponential discounting gives rise to time inconsistency. Other famous examples of time inconsistency include mean-variance portfolio choice and prospect theory in a dynamic context. For such models, the very concept of optimality becomes problematic, as the decision maker's preferences change over time in a temporally inconsistent way. In this book, a time-inconsistent problem is viewed as a non-cooperative game between the agent's current and future selves, with the objective of finding intrapersonal equilibria in the game-theoretic sense. A range of finance applications are provided, including problems with non-exponential discounting, mean-variance objective, time-inconsistent linear quadratic regulator, probability distortion, and market equilibrium with time-inconsistent preferences. Time-Inconsistent Control Theory with Finance Applications offers the first comprehensive treatment of time-inconsistent control and stopping problems, in both continuous and discrete time, and in the context of finance applications. Intended for researchers and graduate students in the fields of finance and economics, it includes a review of the standard time-consistent results, bibliographical notes, as well as detailed examples showcasing time inconsistency problems. For the reader unacquainted with standard arbitrage theory, an appendix provides a toolbox of material needed for the book.

This book presents state-of-the-art research advances in the field of biologically inspired cooperative control theories and their applications. It describes various biologically inspired cooperative control and optimization approaches and highlights real-world examples in complex industrial processes. Multidisciplinary in nature and closely integrating theory and practice, the book will be of interest to all university researchers, control engineers and graduate students in intelligent systems and control who wish to learn the core principles, methods, algorithms, and applications.

This book combines, in a novel and general way, an extensive development of the theory of families of commuting matrices with applications to zero-dimensional commutative rings, primary decompositions and polynomial system solving. It integrates the Linear Algebra of the Third Millennium, developed exclusively here, with classical algorithmic and algebraic techniques. Even the experienced reader will be pleasantly surprised to discover new and unexpected aspects in a variety of subjects including eigenvalues and eigenspaces of linear maps, joint eigenspaces of commuting families of endomorphisms, multiplication maps of zero-dimensional affine algebras, computation of primary decompositions and maximal ideals, and solution of polynomial systems. This book completes a trilogy initiated by the uncharacteristically witty books Computational Commutative Algebra 1 and 2 by the same authors. The material treated here is not available in book form, and much of it is not available at all. The authors continue to present it in their lively and humorous style, interspersing core content with funny quotations and tongue-in-cheek explanations.

Nash equilibrium is the central solution concept in Game Theory. Since Nash's original paper in 1951, it has found countless applications in modeling strategic behavior of traders in markets, (human) drivers and (electronic) routers in congested networks, nations in nuclear disarmament negotiations, and more. A decade ago, the relevance of this solution concept was called into question by computer scientists, who proved (under appropriate complexity assumptions) that computing a Nash equilibrium is an intractable problem. And if centralized, specially designed algorithms cannot find Nash equilibria, why should we expect distributed, selfish agents to converge to one? The remaining hope was that at least approximate Nash equilibria can be efficiently computed.Understanding whether there is an efficient algorithm for approximate Nash equilibrium has been the central open problem in this field for the past decade. In this book, we provide strong evidence that even finding an approximate Nash equilibrium is intractable. We prove several intractability theorems for different settings (two-player games and many-player games) and models (computational complexity, query complexity, and communication complexity). In particular, our main result is that under a plausible and natural complexity assumption ("Exponential Time Hypothesis for PPAD"), there is no polynomial-time algorithm for finding an approximate Nash equilibrium in two-player games. The problem of approximate Nash equilibrium in a two-player game poses a unique technical challenge: it is a member of the class PPAD, which captures the complexity of several fundamental total problems, i.e., problems that always have a solution; and it also admits a quasipolynomial time algorithm. Either property alone is believed to place this problem far below NP-hard problems in the complexity hierarchy; having both simultaneously places it just above P, at what can be called the frontier of intractability. Indeed, the tools we develop in this book to advance on this frontier are useful for proving hardness of approximation of several other important problems whose complexity lies between P and NP: Brouwer's fixed point, market equilibrium, CourseMatch (A-CEEI), densest k-subgraph, community detection, VC dimension and Littlestone dimension, and signaling in zero-sum games.

The book focuses on the next fields of computer science: combinatorial optimization, scheduling theory, decision theory, and computer-aided production management systems. It also offers a quick introduction into the theory of PSC-algorithms, which are a new class of efficient methods for intractable problems of combinatorial optimization. A PSC-algorithm is an algorithm which includes: sufficient conditions of a feasible solution optimality for which their checking can be implemented only at the stage of a feasible solution construction, and this construction is carried out by a polynomial algorithm (the first polynomial component of the PSC-algorithm); an approximation algorithm with polynomial complexity (the second polynomial component of the PSC-algorithm); also, for NP-hard combinatorial optimization problems, an exact subalgorithm if sufficient conditions were found, fulfilment of which during the algorithm execution turns it into a polynomial complexity algorithm. Practitioners and software developers will find the book useful for implementing advanced methods of production organization in the fields of planning (including operative planning) and decision making. Scientists, graduate and master students, or system engineers who are interested in problems of combinatorial optimization, decision making with poorly formalized overall goals, or a multiple regression construction will benefit from this book.

This book presents the topology optimization theory for laminar flows with low and moderate Reynolds numbers, based on the density method and level-set method, respectively. The density-method-based theory offers efficient convergence, while the level-set-method-based theory can provide anaccurate mathematical expression of the structural boundary. Unsteady, body-force-driven and two-phase properties are basic characteristics of the laminar flows. The book discusses these properties, which are typical of microfluidics and one of the research hotspots in the area of Micro-Electro-Mechanical Systems (MEMS), providing an efficient inverse design approach for microfluidic structures. To demonstrate the applications of this topology optimization theory in the context of microfluidics, it also investigates inverse design for the micromixer, microvalve and micropump, which are key elements in lab-on-chip devices.

This proceedings book presents selected contributions from the XVIII Congress of APDIO (the Portuguese Association of Operational Research) held in Valenca on June 28-30, 2017. Prepared by leading Portuguese and international researchers in the field of operations research, it covers a wide range of complex real-world applications of operations research methods using recent theoretical techniques, in order to narrow the gap between academic research and practical applications. Of particular interest are the applications of, nonlinear and mixed-integer programming, data envelopment analysis, clustering techniques, hybrid heuristics, supply chain management, and lot sizing and job scheduling problems. In most chapters, the problems, methods and methodologies described are complemented by supporting figures, tables and algorithms. The XVIII Congress of APDIO marked the 18th installment of the regular biannual meetings of APDIO - the Portuguese Association of Operational Research. The meetings bring together researchers, scholars and practitioners, as well as MSc and PhD students, working in the field of operations research to present and discuss their latest works. The main theme of the latest meeting was Operational Research Pro Bono. Given the breadth of topics covered, the book offers a valuable resource for all researchers, students and practitioners interested in the latest trends in this field.

This new work by Wilfred Kaplan, the distinguished author of influential mathematics and engineering texts, is destined to become a classic. Timely, concise, and content-driven, it provides an intermediate-level treatment of maxima, minima, and optimization. Assuming only a background in calculus and some linear algebra, Professor Kaplan presents topics in order of difficulty. In four short chapters, he describes basic concepts and geometric aspects of maxima and minima, progresses to problems with side conditions, introduces optimization and programming, and concludes with an in-depth discussion of research topics involving the duality theorems of Fenchel and Rockafellar. Throughout the text, the subject of convexity is gradually developed-from its theoretical underpinnings to problems, and finally, to its role in applications. Other features include:
* A strong emphasis on practical applications of maxima and minima
* An impressive array of supporting topics such as numerical analysis
* An ample number of examples and problems
* More than 60 illustrations highlighting the text
* Algorithms to reinforce concepts
* An appendix reviewing the prerequisite linear algebra
Maxima and Minima with Applications is an ideal text for upper-undergraduate and graduate students taking courses in operations research, management, general engineering, and applied mathematics. It can also be used to supplement courses on linear and nonlinear optimization. This volume's broad scope makes it an excellent reference for professionals wishing to learn more about cutting-edge topics in optimization and mathematical programming.

This book addresses mathematics in a wide variety of applications, ranging from problems in electronics, energy and the environment, to mechanics and mechatronics. Using the classification system defined in the EU Framework Programme for Research and Innovation H2020, several of the topics covered belong to the challenge climate action, environment, resource efficiency and raw materials; and some to health, demographic change and wellbeing; while others belong to Europe in a changing world - inclusive, innovative and reflective societies. The 19th European Conference on Mathematics for Industry, ECMI2016, was held in Santiago de Compostela, Spain in June 2016. The proceedings of this conference include the plenary lectures, ECMI awards and special lectures, mini-symposia (including the description of each mini-symposium) and contributed talks. The ECMI conferences are organized by the European Consortium for Mathematics in Industry with the aim of promoting interaction between academy and industry, leading to innovation in both fields and providing unique opportunities to discuss the latest ideas, problems and methodologies, and contributing to the advancement of science and technology. They also encourage industrial sectors to propose challenging problems where mathematicians can provide insights and fresh perspectives. Lastly, the ECMI conferences are one of the main forums in which significant advances in industrial mathematics are presented, bringing together prominent figures from business, science and academia to promote the use of innovative mathematics in industry.

This book provides a comprehensive account of the glowworm swarm optimization (GSO) algorithm, including details of the underlying ideas, theoretical foundations, algorithm development, various applications, and MATLAB programs for the basic GSO algorithm. It also discusses several research problems at different levels of sophistication that can be attempted by interested researchers. The generality of the GSO algorithm is evident in its application to diverse problems ranging from optimization to robotics. Examples include computation of multiple optima, annual crop planning, cooperative exploration, distributed search, multiple source localization, contaminant boundary mapping, wireless sensor networks, clustering, knapsack, numerical integration, solving fixed point equations, solving systems of nonlinear equations, and engineering design optimization. The book is a valuable resource for researchers as well as graduate and undergraduate students in the area of swarm intelligence and computational intelligence and working on these topics.

This book presents the design of delay-efficient packet schedulers for heterogeneous M2M uplink traffic classified into several classes, based on packet delay requirements, payload size, arrival process, etc. Specifically, the authors use tools from queuing theory to determine the delay-optimal scheduling policy. The proposed packet schedulers are designed for a generic M2M architecture and thus equally applicable to any M2M application. Additionally, due to their low implementation complexity and excellent delay-performance, they authors show how they are also well-suited for practical M2M systems. The book pertains primarily to real-time process scheduler experts in industry/academia and graduate students whose research deals with designing Quality-of-Service-aware packet schedulers for M2M packet schedulers over existing and future cellular infrastructure. Presents queuing theoretic analysis and optimization techniques used to design proposed packet scheduling strategies; Provides utility functions to precisely model diverse delay requirements, which lends itself to formulation of utility-maximization problems for determining the delay- or utility-optimal packet scheduler; Includes detail on low implementation complexity of the proposed scheduler by using iterative and distributed optimization techniques.