This tutorial introduces readers to several variants of routing problems with profits. In these routing problems each node has a certain profit, and not all nodes need to be visited. Since the orienteering problem (OP) is by far the most frequently studied problem in this category of routing problems, the book mainly focuses on the OP. In turn, other problems are presented as variants of the OP, focusing on the similarities and differences. The goal of the OP is to determine a subset of nodes to visit and in which order, so that the total collected profit is maximized and a given time budget is not exceeded.The book provides a comprehensive review of variants of the OP, such as the team OP, the team OP with time windows, the profitable tour problem, and the prize-collecting travelling salesperson problem. In addition, it presents mathematical models and techniques for solving these OP variants and discusses their complexity. Several simple examples and benchmark instances, together with their best-known results, are also included. Finally, the book reviews the latest applications of these problems in the fields of logistics, tourism and others.

This book provides a comprehensive study of turnpike phenomenon arising in optimal control theory. The focus is on individual (non-generic) turnpike results which are both mathematically significant and have numerous applications in engineering and economic theory. All results obtained in the book are new. New approaches, techniques, and methods are rigorously presented and utilize research from finite-dimensional variational problems and discrete-time optimal control problems to find the necessary conditions for the turnpike phenomenon in infinite dimensional spaces. The semigroup approach is employed in the discussion as well as PDE descriptions of continuous-time dynamics. The main results on sufficient and necessary conditions for the turnpike property are completely proved and the numerous illustrative examples support the material for the broad spectrum of experts. Mathematicians interested in the calculus of variations, optimal control and in applied functional analysis will find this book a useful guide to the turnpike phenomenon in infinite dimensional spaces. Experts in economic and engineering modeling as well as graduate students will also benefit from the developed techniques and obtained results.

This book proposes, for the first time, a basic formulation for structural control that takes into account the stochastic dynamics induced by engineering excitations in the nature of non-stationary and non-Gaussian processes. Further, it establishes the theory of and methods for stochastic optimal control of randomly-excited engineering structures in the context of probability density evolution methods, such as physically-based stochastic optimal (PSO) control. By logically integrating randomness into control gain, the book helps readers design elegant control systems, mitigate risks in civil engineering structures, and avoid the dilemmas posed by the methods predominantly applied in current practice, such as deterministic control and classical linear quadratic Gaussian (LQG) control associated with nominal white noises.

This book presents cutting-edge contributions in the areas of control theory and partial differential equations. Over the decades, control theory has had deep and fruitful interactions with the theory of partial differential equations (PDEs). Well-known examples are the study of the generalized solutions of Hamilton-Jacobi-Bellman equations arising in deterministic and stochastic optimal control and the development of modern analytical tools to study the controllability of infinite dimensional systems governed by PDEs. In the present volume, leading experts provide an up-to-date overview of the connections between these two vast fields of mathematics. Topics addressed include regularity of the value function associated to finite dimensional control systems, controllability and observability for PDEs, and asymptotic analysis of multiagent systems. The book will be of interest for both researchers and graduate students working in these areas.

This book focuses on the development of approximation-related algorithms and their relevant applications. Individual contributions are written by leading experts and reflect emerging directions and connections in data approximation and optimization. Chapters discuss state of the art topics with highly relevant applications throughout science, engineering, technology and social sciences. Academics, researchers, data science practitioners, business analysts, social sciences investigators and graduate students will find the number of illustrations, applications, and examples provided useful. This volume is based on the conference Approximation and Optimization: Algorithms, Complexity, and Applications, which was held in the National and Kapodistrian University of Athens, Greece, June 29-30, 2017. The mix of survey and research content includes topics in approximations to discrete noisy data; binary sequences; design of networks and energy systems; fuzzy control; large scale optimization; noisy data; data-dependent approximation; networked control systems; machine learning ; optimal design; no free lunch theorem; non-linearly constrained optimization; spectroscopy.

This volume collects papers, based on invited talks given at the IMA workshop in Modeling, Stochastic Control, Optimization, and Related Applications, held at the Institute for Mathematics and Its Applications, University of Minnesota, during May and June, 2018. There were four week-long workshops during the conference. They are (1) stochastic control, computation methods, and applications, (2) queueing theory and networked systems, (3) ecological and biological applications, and (4) finance and economics applications. For broader impacts, researchers from different fields covering both theoretically oriented and application intensive areas were invited to participate in the conference. It brought together researchers from multi-disciplinary communities in applied mathematics, applied probability, engineering, biology, ecology, and networked science, to review, and substantially update most recent progress. As an archive, this volume presents some of the highlights of the workshops, and collect papers covering a broad range of topics.

There has been an increase in attention toward systems involving large numbers of small players, giving rise to the theory of mean field games, mean field type control and nonlinear Markov games. Exhibiting various real world problems involving major and minor agents, this book presents a systematic continuous-space approximation approach for mean-field interacting agents models and mean-field games models. After describing Markov-chain methodology and a modeling of mean-field interacting systems, the text presents various structural conditions on the chain to yield respective socio-economic models, focusing on migration models via binary interactions. The specific applications are wide-ranging - including inspection and corruption, cyber-security, counterterrorism, coalition building and network growth, minority games, and investment policies and optimal allocation - making this book relevant to a wide audience of applied mathematicians interested in operations research, computer science, national security, economics, and finance.

This book provides a basic, initial resource, introducing science and engineering students to the field of optimization. It covers three main areas: mathematical programming, calculus of variations and optimal control, highlighting the ideas and concepts and offering insights into the importance of optimality conditions in each area. It also systematically presents affordable approximation methods. Exercises at various levels have been included to support the learning process.

Graduate students and researchers in applied mathematics, optimization, engineering, computer science, and management science will find this book a useful reference which provides an introduction to applications and fundamental theories in nonlinear combinatorial optimization. Nonlinear combinatorial optimization is a new research area within combinatorial optimization and includes numerous applications to technological developments, such as wireless communication, cloud computing, data science, and social networks. Theoretical developments including discrete Newton methods, primal-dual methods with convex relaxation, submodular optimization, discrete DC program, along with several applications are discussed and explored in this book through articles by leading experts.

This volume collects contributions from the speakers at an INdAM Intensive period held at the University of Bari in 2017. The contributions cover several aspects of partial differential equations whose development in recent years has experienced major breakthroughs in terms of both theory and applications. The topics covered include nonlocal equations, elliptic equations and systems, fully nonlinear equations, nonlinear parabolic equations, overdetermined boundary value problems, maximum principles, geometric analysis, control theory, mean field games, and bio-mathematics. The authors are trailblazers in these topics and present their work in a way that is exhaustive and clearly accessible to PhD students and early career researcher. As such, the book offers an excellent introduction to a variety of fundamental topics of contemporary investigation and inspires novel and high-quality research.

The purpose of this book is to provide readers with an introduction to the very active field of integer programming and network models. The idea is to cover the main parts of the field without being too detailed or too technical. As a matter of fact, we found it somewhat surprising that most--especially newer---books are strongly algorithmically oriented. In contrast, the main emphasis of this book is on models rather than methods. This focus expresses our view that methods are tools to solve actual problems and not ends in themselves. As such, graduate (and with some omissions, undergraduate) students may find this book helpful in their studies as will practitioners who would like to get acquainted with a field or use this text as a refresher. This premise has resulted in a coverage that omits material that is standard fare in other books, whereas it covers topics that are only infrequently found elsewhere. There are some, yet relatively few, prerequisites for the reader. Most material that is required for the understanding of more than one chapter is presented in one of the four chapters of the introductory part, which reviews the main results in linear programming, the analysis of algorithms, graphs and networks, and dynamic programming, respectively. Readers who are familiar with the issues involved can safely skip that part. The three main parts of the book rely on intuitive reasoning and examples, whenever practical, instead of theorems and proofs.

This book presents the topological derivative method through selected examples, using a direct approach based on calculus of variations combined with compound asymptotic analysis. This new concept in shape optimization has applications in many different fields such as topology optimization, inverse problems, imaging processing, multi-scale material design and mechanical modeling including damage and fracture evolution phenomena. In particular, the topological derivative is used here in numerical methods of shape optimization, with applications in the context of compliance structural topology optimization and topology design of compliant mechanisms. Some exercises are offered at the end of each chapter, helping the reader to better understand the involved concepts.

The contributions included in the volume are drawn from presentations at ODS2019 - International Conference on Optimization and Decision Science, which was the 49th annual meeting of the Italian Operations Research Society (AIRO) held at Genoa, Italy, on 4-7 September 2019. This book presents very recent results in the field of Optimization and Decision Science. While the book is addressed primarily to the Operations Research (OR) community, the interdisciplinary contents ensure that it will also be of very high interest for scholars and researchers from many scientific disciplines, including computer sciences, economics, mathematics, and engineering. Operations Research is known as the discipline of optimization applied to real-world problems and to complex decision-making fields. The focus is on mathematical and quantitative methods aimed at determining optimal or near-optimal solutions in acceptable computation times. This volume not only presents theoretical results but also covers real industrial applications, making it interesting for practitioners facing decision problems in logistics, manufacturing production, and services. Readers will accordingly find innovative ideas from both a methodological and an applied perspective.

This monograph investigates the existence of higher order sliding mode in discrete-time systems and propounds a new concept of discrete-time higher order sliding mode. The authors propose a definition of discrete-time higher order sliding mode and a control law is designed by means of a concept for an uncertain linear-time invariant system, as well as the behavior of the closed-loop system is analyzed. Moreover, the book includes a thorough treatment of the probabilistic and non-deterministic case, i.e. stochastic discrete-time higher order sliding mode. The target audience primarily comprises research experts in control theory but the book may also be beneficial for graduate students alike.

This book is devoted to the study of optimal control problems arising in forest management, an important and fascinating topic in mathematical economics studied by many researchers over the years. The volume studies the forest management problem by analyzing a class of optimal control problems that contains it and showing the existence of optimal solutions over infinite horizon. It also studies the structure of approximate solutions on finite intervals and their turnpike properties, as well as the stability of the turnpike phenomenon and the structure of approximate solutions on finite intervals in the regions close to the end points. The book is intended for mathematicians interested in the optimization theory, optimal control and their applications to the economic theory.

This comprehensive treatment of multivariable calculus focuses on the numerous tools that MATLAB (R) brings to the subject, as it presents introductions to geometry, mathematical physics, and kinematics. Covering simple calculations with MATLAB (R), relevant plots, integration, and optimization, the numerous problem sets encourage practice with newly learned skills that cultivate the reader's understanding of the material. Significant examples illustrate each topic, and fundamental physical applications such as Kepler's Law, electromagnetism, fluid flow, and energy estimation are brought to prominent position. Perfect for use as a supplement to any standard multivariable calculus text, a "mathematical methods in physics or engineering" class, for independent study, or even as the class text in an "honors" multivariable calculus course, this textbook will appeal to mathematics, engineering, and physical science students. MATLAB (R) is tightly integrated into every portion of this book, and its graphical capabilities are used to present vibrant pictures of curves and surfaces. Readers benefit from the deep connections made between mathematics and science while learning more about the intrinsic geometry of curves and surfaces. With serious yet elementary explanation of various numerical algorithms, this textbook enlivens the teaching of multivariable calculus and mathematical methods courses for scientists and engineers.

This volume collects papers, based on invited talks given at the IMA workshop in Modeling, Stochastic Control, Optimization, and Related Applications, held at the Institute for Mathematics and Its Applications, University of Minnesota, during May and June, 2018. There were four week-long workshops during the conference. They are (1) stochastic control, computation methods, and applications, (2) queueing theory and networked systems, (3) ecological and biological applications, and (4) finance and economics applications. For broader impacts, researchers from different fields covering both theoretically oriented and application intensive areas were invited to participate in the conference. It brought together researchers from multi-disciplinary communities in applied mathematics, applied probability, engineering, biology, ecology, and networked science, to review, and substantially update most recent progress. As an archive, this volume presents some of the highlights of the workshops, and collect papers covering a broad range of topics.

Graduate students and researchers in applied mathematics, optimization, engineering, computer science, and management science will find this book a useful reference which provides an introduction to applications and fundamental theories in nonlinear combinatorial optimization. Nonlinear combinatorial optimization is a new research area within combinatorial optimization and includes numerous applications to technological developments, such as wireless communication, cloud computing, data science, and social networks. Theoretical developments including discrete Newton methods, primal-dual methods with convex relaxation, submodular optimization, discrete DC program, along with several applications are discussed and explored in this book through articles by leading experts.

This clear and concise textbook provides a rigorous introduction to the calculus of variations, depending on functions of one variable and their first derivatives. It is based on a translation of a German edition of the book Variationsrechnung (Vieweg+Teubner Verlag, 2010), translated and updated by the author himself. Topics include: the Euler-Lagrange equation for one-dimensional variational problems, with and without constraints, as well as an introduction to the direct methods. The book targets students who have a solid background in calculus and linear algebra, not necessarily in functional analysis. Some advanced mathematical tools, possibly not familiar to the reader, are given along with proofs in the appendix. Numerous figures, advanced problems and proofs, examples, and exercises with solutions accompany the book, making it suitable for self-study. The book will be particularly useful for beginning graduate students from the physical, engineering, and mathematical sciences with a rigorous theoretical background.

The focus of this book is the large-scale statistical behavior of solutions of divergence-form elliptic equations with random coefficients, which is closely related to the long-time asymptotics of reversible diffusions in random media and other basic models of statistical physics. Of particular interest is the quantification of the rate at which solutions converge to those of the limiting, homogenized equation in the regime of large scale separation, and the description of their fluctuations around this limit. This self-contained presentation gives a complete account of the essential ideas and fundamental results of this new theory of quantitative stochastic homogenization, including the latest research on the topic, and is supplemented with many new results. The book serves as an introduction to the subject for advanced graduate students and researchers working in partial differential equations, statistical physics, probability and related fields, as well as a comprehensive reference for experts in homogenization. Being the first text concerned primarily with stochastic (as opposed to periodic) homogenization and which focuses on quantitative results, its perspective and approach are entirely different from other books in the literature.

This book focuses on the development of approximation-related algorithms and their relevant applications. Individual contributions are written by leading experts and reflect emerging directions and connections in data approximation and optimization. Chapters discuss state of the art topics with highly relevant applications throughout science, engineering, technology and social sciences. Academics, researchers, data science practitioners, business analysts, social sciences investigators and graduate students will find the number of illustrations, applications, and examples provided useful. This volume is based on the conference Approximation and Optimization: Algorithms, Complexity, and Applications, which was held in the National and Kapodistrian University of Athens, Greece, June 29-30, 2017. The mix of survey and research content includes topics in approximations to discrete noisy data; binary sequences; design of networks and energy systems; fuzzy control; large scale optimization; noisy data; data-dependent approximation; networked control systems; machine learning ; optimal design; no free lunch theorem; non-linearly constrained optimization; spectroscopy.

This book presents advanced case studies that address a range of important issues arising in space engineering. An overview of challenging operational scenarios is presented, with an in-depth exposition of related mathematical modeling, algorithmic and numerical solution aspects. The model development and optimization approaches discussed in the book can be extended also towards other application areas. The topics discussed illustrate current research trends and challenges in space engineering as summarized by the following list: * Next Generation Gravity Missions * Continuous-Thrust Trajectories by Evolutionary Neurocontrol * Nonparametric Importance Sampling for Launcher Stage Fallout * Dynamic System Control Dispatch * Optimal Launch Date of Interplanetary Missions * Optimal Topological Design * Evidence-Based Robust Optimization * Interplanetary Trajectory Design by Machine Learning * Real-Time Optimal Control * Optimal Finite Thrust Orbital Transfers * Planning and Scheduling of Multiple Satellite Missions * Trajectory Performance Analysis * Ascent Trajectory and Guidance Optimization * Small Satellite Attitude Determination and Control * Optimized Packings in Space Engineering * Time-Optimal Transfers of All-Electric GEO Satellites Researchers working on space engineering applications will find this work a valuable, practical source of information. Academics, graduate and post-graduate students working in aerospace, engineering, applied mathematics, operations research, and optimal control will find useful information regarding model development and solution techniques, in conjunction with real-world applications.

This book highlights the latest developments in the geometry of measurable sets, presenting them in simple, straightforward terms. It addresses nonlocal notions of perimeter and curvature and studies in detail the minimal surfaces associated with them. These notions of nonlocal perimeter and curvature are defined on the basis of a non-singular kernel. Further, when the kernel is appropriately rescaled, they converge toward the classical perimeter and curvature as the rescaling parameter tends to zero. In this way, the usual notions can be recovered by using the nonlocal ones. In addition, nonlocal heat content is studied and an asymptotic expansion is obtained. Given its scope, the book is intended for undergraduate and graduate students, as well as senior researchers interested in analysis and/or geometry.

There has been an increase in attention toward systems involving large numbers of small players, giving rise to the theory of mean field games, mean field type control and nonlinear Markov games. Exhibiting various real world problems involving major and minor agents, this book presents a systematic continuous-space approximation approach for mean-field interacting agents models and mean-field games models. After describing Markov-chain methodology and a modeling of mean-field interacting systems, the text presents various structural conditions on the chain to yield respective socio-economic models, focusing on migration models via binary interactions. The specific applications are wide-ranging - including inspection and corruption, cyber-security, counterterrorism, coalition building and network growth, minority games, and investment policies and optimal allocation - making this book relevant to a wide audience of applied mathematicians interested in operations research, computer science, national security, economics, and finance.

The satellite range scheduling (SRS) problem, an important operations research problem in the aerospace industry consisting of allocating tasks among satellites and Earth-bound objects, is examined in this book. SRS principles and solutions are applicable to many areas, including: Satellite communications, where tasks are communication intervals between sets of satellites and ground stations Earth observation, where tasks are observations of spots on the Earth by satellites Sensor scheduling, where tasks are observations of satellites by sensors on the Earth. This self-contained monograph begins with a structured compendium of the problem and moves on to explain the optimal approach to the solution, which includes aspects from graph theory, set theory, game theory and belief networks. This book is accessible to students, professionals and researchers in a variety of fields, including: operations research, optimization, scheduling theory, dynamic programming and game theory. Taking account of the distributed, stochastic and dynamic variants of the problem, this book presents the optimal solution to the fixed interval SRS problem and how to migrate results into more complex cases. Reference algorithms and traditional algorithms for solving the scheduling problems are provided and compared with examples and simulations in practical scenarios.