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.

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.

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 monograph presents a comprehensive treatment of the maximum-entropy sampling problem (MESP), which is a fascinating topic at the intersection of mathematical optimization and data science. The text situates MESP in information theory, as the algorithmic problem of calculating a sub-vector of pre-specificed size from a multivariate Gaussian random vector, so as to maximize Shannon's differential entropy. The text collects and expands on state-of-the-art algorithms for MESP, and addresses its application in the field of environmental monitoring. While MESP is a central optimization problem in the theory of statistical designs (particularly in the area of spatial monitoring), this book largely focuses on the unique challenges of its algorithmic side. From the perspective of mathematical-optimization methodology, MESP is rather unique (a 0/1 nonlinear program having a nonseparable objective function), and the algorithmic techniques employed are highly non-standard. In particular, successful techniques come from several disparate areas within the field of mathematical optimization; for example: convex optimization and duality, semidefinite programming, Lagrangian relaxation, dynamic programming, approximation algorithms, 0/1 optimization (e.g., branch-and-bound), extended formulation, and many aspects of matrix theory. The book is mainly aimed at graduate students and researchers in mathematical optimization and data analytics.

Many of the most challenging problems in the applied sciences involve non-differentiable structures as well as partial differential operators, thus leading to non-smooth distributed parameter systems. This edited volume aims to establish a theoretical and numerical foundation and develop new algorithmic paradigms for the treatment of non-smooth phenomena and associated parameter influences. Other goals include the realization and further advancement of these concepts in the context of robust and hierarchical optimization, partial differential games, and nonlinear partial differential complementarity problems, as well as their validation in the context of complex applications. Areas for which applications are considered include optimal control of multiphase fluids and of superconductors, image processing, thermoforming, and the formation of rivers and networks. Chapters are written by leading researchers and present results obtained in the first funding phase of the DFG Special Priority Program on Nonsmooth and Complementarity Based Distributed Parameter Systems: Simulation and Hierarchical Optimization that ran from 2016 to 2019.

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

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.

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

This book describes applications of Jaya and Rao algorithms on real case studies concerning different renewable energy sources. In the last few decades, researchers have focused on renewable energy resources like solar energy, bio-energy, wave energy, ocean thermal energy, tidal energy, geothermal energy, and wind energy. This has resulted in the development of new techniques and tools that could harvest energy from renewable energy sources. Many researchers and scientists have focused on developing and optimizing the energy systems to extract and utilize renewable energy more efficiently. In this book, recently developed Jaya and Rao (Rao-1, Rao-2, and Rao-3) algorithms are introduced for single- and multi-objective optimization of selected renewable energy systems. The results of applications of the different versions of Jaya and Rao algorithms are compared with the other optimization techniques like GA, NSGA-II, PSO, MOPSO, ABC, etc., and the performance of the Jaya and Rao algorithms is highlighted compared to other optimization algorithms in the case of renewable energy systems. The book also includes the validation of different versions of the Jaya and Rao algorithms through the application to complex single- and multi-objective unconstrained benchmark functions. The algorithms and computer codes of different version of Jaya and Rao algorithms are included in the book that will be very much useful to readers in industry and academic research.

This monograph covers one of the divisions of mathematical theory of control which examines moving objects functionating under conflict and uncertainty conditions. To identify this range of problems we use the term "conflict con trolled processes," coined in recent years. As the name itself does not imply the type of dynamics (difference, ordinary differential, difference-differential, integral, or partial differential equations) the differential games falI within its realms. The problems of search and tracking moving objects are also referred to the field of conflict controlled process. The contents of the monograph is confined to studying classical pursuit-evasion problems which are central to the theory of conflict controlled processes. These problems underlie the theory and are of considerable interest to researchers up to now. It should be noted that the methods of "Line of Sight," "Parallel Pursuit," "Proportional N avigation,""Modified Pursuit" and others have been long and well known among engineers engaged in design of rocket and space technology. An abstract theory of dynamic game problems, in its turn, is based on the methods originated by R. Isaacs, L. S. Pontryagin, and N. N. Krasovskii, and on the approaches developed around these methods. At the heart of the book is the Method of Resolving Functions which was realized within the class of quasistrategies for pursuers and then applied to the solution of the problems of "hand-to-hand," group, and succesive pursuit."

The concept of "reformulation" has long been playing an important role in mathematical programming. A classical example is the penalization technique in constrained optimization that transforms the constraints into the objective function via a penalty function thereby reformulating a constrained problem as an equivalent or approximately equivalent unconstrained problem. More recent trends consist of the reformulation of various mathematical programming prob lems, including variational inequalities and complementarity problems, into equivalent systems of possibly nonsmooth, piecewise smooth or semismooth nonlinear equations, or equivalent unconstrained optimization problems that are usually differentiable, but in general not twice differentiable. Because of the recent advent of various tools in nonsmooth analysis, the reformulation approach has become increasingly profound and diversified. In view of growing interests in this active field, we planned to organize a cluster of sessions entitled "Reformulation - Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods" in the 16th International Symposium on Mathematical Programming (ismp97) held at Lausanne EPFL, Switzerland on August 24-29, 1997. Responding to our invitation, thirty-eight people agreed to give a talk within the cluster, which enabled us to organize thirteen sessions in total. We think that it was one of the largest and most exciting clusters in the symposium. Thanks to the earnest support by the speakers and the chairpersons, the sessions attracted much attention of the participants and were filled with great enthusiasm of the audience."

• Provides well-written self-contained chapters, including problem sets and exercises, making it ideal for the classroom setting;
• Introduces applied optimization to the hazardous waste blending problem;
• Explores linear programming, nonlinear programming, discrete optimization, global optimization, optimization under uncertainty, multi-objective optimization, optimal control and stochastic optimal control;
• Includes an extensive bibliography at the end of each chapter and an index;
• GAMS files of case studies for Chapters 2, 3, 4, 5, and 7 are linked to http: //www.springer.com/math/book/978-0-387-76634-8;

Solutions manual available upon adoptions.

This work presents lines of investigation and scientific achievements of the Ukrainian school of optimization theory and adjacent disciplines. These include the development of approaches to mathematical theories, methodologies, methods, and application systems for the solution of applied problems in economy, finances, energy saving, agriculture, biology, genetics, environmental protection, hardware and software engineering, information protection, decision making, pattern recognition, self-adapting control of complicated objects, personnel training, etc. The methods developed include sequential analysis of variants, nondifferential optimization, stochastic optimization, discrete optimization, mathematical modeling, econometric modeling, solution of extremum problems on graphs, construction of discrete images and combinatorial recognition, etc. Some of these methods became well known in the world's mathematical community and are now known as classic methods.

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

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

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

Recent results on non-convex multi-objective optimization problems and methods are presented in this book, with particular attention to expensive black-box objective functions. Multi-objective optimization methods facilitate designers, engineers, and researchers to make decisions on appropriate trade-offs between various conflicting goals. A variety of deterministic and stochastic multi-objective optimization methods are developed in this book. Beginning with basic concepts and a review of non-convex single-objective optimization problems; this book moves on to cover multi-objective branch and bound algorithms, worst-case optimal algorithms (for Lipschitz functions and bi-objective problems), statistical models based algorithms, and probabilistic branch and bound approach. Detailed descriptions of new algorithms for non-convex multi-objective optimization, their theoretical substantiation, and examples for practical applications to the cell formation problem in manufacturing engineering, the process design in chemical engineering, and business process management are included to aide researchers and graduate students in mathematics, computer science, engineering, economics, and business management.

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

This book deals with several types of multi-dimensional control problems in the face of data uncertainty for vector cases-multi-dimensional multi-objective control problem with uncertain objective functionals, uncertain constraint functionals, and uncertain objective as well as constraint functionals, uncertain multi-dimensional multi-objective control problem with semi-infinite constraints, uncertain dual multi-dimensional multi-objective variational control problem, and second-order PDE&PDI constrained robust optimization problem. The book provides the solution approaches-an exact l1 penalty function approach, modified objective approach, robust approach-in the simplest way to solve the recent developing optimization problems in the sense of uncertainty.

This book focuses primarily on the nature-inspired approach for designing smart applications. It includes several implementation paradigms such as design and path planning of wireless network, security mechanism and implementation for dynamic as well as static nodes, learning method of cloud computing, data exploration and management, data analysis and optimization, decision taking in conflicting environment, etc. The book fundamentally highlights the recent research advancements in the field of engineering and science.

This volume presents state-of-the-art complementarity applications, algorithms, extensions and theory in the form of eighteen papers. These at the International Conference on Com invited papers were presented plementarity 99 (ICCP99) held in Madison, Wisconsin during June 9-12, 1999 with support from the National Science Foundation under Grant DMS-9970102. Complementarity is becoming more widely used in a variety of appli cation areas. In this volume, there are papers studying the impact of complementarity in such diverse fields as deregulation of electricity mar kets, engineering mechanics, optimal control and asset pricing. Further more, application of complementarity and optimization ideas to related problems in the burgeoning fields of machine learning and data mining are also covered in a series of three articles. In order to effectively process the complementarity problems that arise in such applications, various algorithmic, theoretical and computational extensions are covered in this volume. Nonsmooth analysis has an im portant role to play in this area as can be seen from articles using these tools to develop Newton and path following methods for constrained nonlinear systems and complementarity problems. Convergence issues are covered in the context of active set methods, global algorithms for pseudomonotone variational inequalities, successive convex relaxation and proximal point algorithms. Theoretical contributions to the connectedness of solution sets and constraint qualifications in the growing area of mathematical programs with equilibrium constraints are also presented. A relaxation approach is given for solving such problems. Finally, computational issues related to preprocessing mixed complementarity problems are addressed."

This text provides a framework in which the main objectives of the field of uncertainty quantification (UQ) are defined and an overview of the range of mathematical methods by which they can be achieved. Complete with exercises throughout, the book will equip readers with both theoretical understanding and practical experience of the key mathematical and algorithmic tools underlying the treatment of uncertainty in modern applied mathematics. Students and readers alike are encouraged to apply the mathematical methods discussed in this book to their own favorite problems to understand their strengths and weaknesses, also making the text suitable for a self-study. Uncertainty quantification is a topic of increasing practical importance at the intersection of applied mathematics, statistics, computation and numerous application areas in science and engineering. This text is designed as an introduction to UQ for senior undergraduate and graduate students with a mathematical or statistical background and also for researchers from the mathematical sciences or from applications areas who are interested in the field. T. J. Sullivan was Warwick Zeeman Lecturer at the Mathematics Institute of the University of Warwick, United Kingdom, from 2012 to 2015. Since 2015, he is Junior Professor of Applied Mathematics at the Free University of Berlin, Germany, with specialism in Uncertainty and Risk Quantification.