Convexity of sets in linear spaces, and concavity and convexity of functions, lie at the root of beautiful theoretical results that are at the same time extremely useful in the analysis and solution of optimization problems, including problems of either single objective or multiple objectives. Not all of these results rely necessarily on convexity and concavity; some of the results can guarantee that each local optimum is also a global optimum, giving these methods broader application to a wider class of problems. Hence, the focus of the first part of the book is concerned with several types of generalized convex sets and generalized concave functions. In addition to their applicability to nonconvex optimization, these convex sets and generalized concave functions are used in the book's second part, where decision-making and optimization problems under uncertainty are investigated. Uncertainty in the problem data often cannot be avoided when dealing with practical problems. Errors occur in real-world data for a host of reasons. However, over the last thirty years, the fuzzy set approach has proved to be useful in these situations. It is this approach to optimization under uncertainty that is extensively used and studied in the second part of this book. Typically, the membership functions of fuzzy sets involved in such problems are neither concave nor convex. They are, however, often quasiconcave or concave in some generalized sense. This opens possibilities for application of results on generalized concavity to fuzzy optimization. Despite this obvious relation, applying the interface of these two areas has been limited to date. It is hoped that the combination of ideas and results from the field of generalized concavity on the one hand and fuzzy optimization on the other hand outlined and discussed in Generalized Concavity in Fuzzy Optimization and Decision Analysis will be of interest to both communities. Our aim is to broaden the classes of problems that the combination of these two areas can satisfactorily address and solve.

This three volume set (CCIS 1237-1239) constitutes the proceedings of the 18th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, IPMU 2020, in June 2020. The conference was scheduled to take place in Lisbon, Portugal, at University of Lisbon, but due to COVID-19 pandemic it was held virtually. The 173 papers were carefully reviewed and selected from 213 submissions. The papers are organized in topical sections: homage to Enrique Ruspini; invited talks; foundations and mathematics; decision making, preferences and votes; optimization and uncertainty; games; real world applications; knowledge processing and creation; machine learning I; machine learning II; XAI; image processing; temporal data processing; text analysis and processing; fuzzy interval analysis; theoretical and applied aspects of imprecise probabilities; similarities in artificial intelligence; belief function theory and its applications; aggregation: theory and practice; aggregation: pre-aggregation functions and other generalizations of monotonicity; aggregation: aggregation of different data structures; fuzzy methods in data mining and knowledge discovery; computational intelligence for logistics and transportation problems; fuzzy implication functions; soft methods in statistics and data analysis; image understanding and explainable AI; fuzzy and generalized quantifier theory; mathematical methods towards dealing with uncertainty in applied sciences; statistical image processing and analysis, with applications in neuroimaging; interval uncertainty; discrete models and computational intelligence; current techniques to model, process and describe time series; mathematical fuzzy logic and graded reasoning models; formal concept analysis, rough sets, general operators and related topics; computational intelligence methods in information modelling, representation and processing.

Evolutionary computation techniques have attracted increasing att- tions in recent years for solving complex optimization problems. They are more robust than traditional methods based on formal logics or mathematical programming for many real world OR/MS problems. E- lutionary computation techniques can deal with complex optimization problems better than traditional optimization techniques. However, most papers on the application of evolutionary computation techniques to Operations Research /Management Science (OR/MS) problems have scattered around in different journals and conference proceedings. They also tend to focus on a very special and narrow topic. It is the right time that an archival book series publishes a special volume which - cludes critical reviews of the state-of-art of those evolutionary com- tation techniques which have been found particularly useful for OR/MS problems, and a collection of papers which represent the latest devel- ment in tackling various OR/MS problems by evolutionary computation techniques. This special volume of the book series on Evolutionary - timization aims at filling in this gap in the current literature. The special volume consists of invited papers written by leading - searchers in the field. All papers were peer reviewed by at least two recognised reviewers. The book covers the foundation as well as the practical side of evolutionary optimization.

This book covers several bases at once. It is useful as a textbook for a second course in experimental optimization techniques for industrial production processes. In addition, it is a superb reference volume for use by professors and graduate students in Industrial Engineering and Statistics departments. It will also be of huge interest to applied statisticians, process engineers, and quality engineers working in the electronics and biotech manufacturing industries. In all, it provides an in-depth presentation of the statistical issues that arise in optimization problems, including confidence regions on the optimal settings of a process, stopping rules in experimental optimization, and more.

In Risk Analysis of Complex and Uncertain Systems acknowledged risk authority Tony Cox shows all risk practitioners how Quantitative Risk Assessment (QRA) can be used to improve risk management decisions and policies. It develops and illustrates QRA methods for complex and uncertain biological, engineering, and social systems – systems that have behaviors that are just too complex to be modeled accurately in detail with high confidence – and shows how they can be applied to applications including assessing and managing risks from chemical carcinogens, antibiotic resistance, mad cow disease, terrorist attacks, and accidental or deliberate failures in telecommunications network infrastructure. This book was written for a broad range of practitioners, including decision risk analysts, operations researchers and management scientists, quantitative policy analysts, economists, health and safety risk assessors, engineers, and modelers.

The generalized area of multiple criteria decision making (MCDM) can be defined as the body of methods and procedures by which the concern for multiple conflicting criteria can be formally incorporated into the analytical process. MCDM consists mostly of two branches, multiple criteria optimization and multi-criteria decision analysis (MCDA). While MCDA is typically concerned with multiple criteria problems that have a small number of alternatives often in an environment of uncertainty (location of an airport, type of drug rehabilitation program), multiple criteria optimization is typically directed at problems formulated within a mathematical programming framework, but with a stack of objectives instead of just one (river basin management, engineering component design, product distribution). It is about the most modern treatment of multiple criteria optimization that this book is concerned. I look at this book as a nicely organized and well-rounded presentation of what I view as ”new wave” topics in multiple criteria optimization. Looking back to the origins of MCDM, most people agree that it was not until about the early 1970s that multiple criteria optimization c- gealed as a field. At this time, and for about the following fifteen years, the focus was on theories of multiple objective linear programming that subsume conventional (single criterion) linear programming, algorithms for characterizing the efficient set, theoretical vector-maximum dev- opments, and interactive procedures.

Risk Analysis: Foundations, Models, and Methods fully addresses the questions of "What is health risk analysis?" and "How can its potentialities be developed to be most valuable to public health decision-makers and other health risk managers?" Risk analysis provides methods and principles for answering these questions. It is divided into methods for assessing, communicating, and managing health risks. Risk assessment quantitatively estimates the health risks to individuals and to groups from hazardous exposures and from the decisions or activities that create them. It applies specialized models and methods to quantify likely exposures and their resulting health risks. Its goal is to produce information to improve decisions. It does this by relating alternative decisions to their probable consequences and by identifying those decisions that make preferred outcomes more likely. Health risk assessment draws on explicit engineering, biomathematical, and statistical consequence models to describe or simulate the causal relations between actions and their probable effects on health. Risk communication characterizes and presents information about health risks and uncertainties to decision-makers and stakeholders. Risk management applies principles for choosing among alternative decision alternatives or actions that affect exposure, health risks, or their consequences.

Proportional Optimization and Fairness is a long-needed attempt to reconcile optimization with apportionment in just-in-time (JIT) sequences and find the common ground in solving problems ranging from sequencing mixed-model just-in-time assembly lines through just-in-time batch production, balancing workloads in event graphs to bandwidth allocation internet gateways and resource allocation in computer operating systems. The book argues that apportionment theory and optimization based on deviation functions provide natural benchmarks for a process, and then looks at the recent research and developments in the field. Individual chapters look at the theory of apportionment and just-in-time sequences; minimization of just-in-time sequence deviation; optimality of cyclic sequences and the oneness; bottleneck minimization; competition-free instances, Fraenkel’s Conjecture, and optimal admission sequences; response time variability; applications to the Liu-Layland Problem and pinwheel scheduling; temporal capacity constraints and supply chain balancing; fair queuing and stride scheduling; and smoothing and batching.

Written by a world leader in the field and aimed at researchers in applied and engineering sciences, this brilliant text has as its main goal imparting an understanding of the methods so that practitioners can make immediate use of existing algorithms and software, and so that researchers can extend the state of the art and find new applications. It includes algorithms on seeking feasibility and analyzing infeasibility, as well as describing new and surprising applications.

This is a carefully developed work focused on the analysis of supply chain interaction issues in emerging markets and industry sectors. It is a leading-edge handbook that will emphasize areas of study where, thus far, little work has been done and where the "rubber meets the road" – the supply chain process, information, and systems integration. These are pertinent issues facing practitioners and researchers in today’s business environment. This is a gap-bridging handbook that analyzes interaction issues from both the research and practitioner sides. The result is a volume that examines and provides practical solutions on interaction issues while being firmly grounded in research principles.