## Continue the series

The book has a mixture of theoretical, algorithmic, and application chapters providing examples of the cutting-edge work that Professor Keilson has done or influenced over the course of his highly-productive and energetic career in applied probability and stochastic processes. The book will be of interest to academic researchers, students, and industrial practitioners who seek to use the mathematics of applied probability in solving problems in modern society.

An interesting feature of this book is the special attention it pays to the analysis of some theoretical and applied aspects of fuzzy criteria and dynamic fuzzy criterion models, thus opening up a new way of injecting the much-needed type of non-cost, intuitive, and easy-to-use methods into multi-stage inventory processes. This is accomplished by constructing and optimizing the fuzzy criterion models developed for inventory processes.

Practitioners in operations research, management science, and engineering will find numerous new ideas and strategies for modeling real world multi- stage inventory problems, and researchers and applied mathematicians will find this work a stimulating and useful reference.

Multicriteria Decision Making: Advances in MCDM Models, Algorithms, Theory and Applications aims to bring together `state-of-the-art' reviews and the most recent advances by leading experts on the fundamental theories, methodologies and applications of MCDM. This is aimed at graduate students and researchers in mathematics, economics, management and engineering, as well as at practicing management scientists who wish to better understand the principles of this new and fast developing field.

This monograph has been designed to appeal to a diverse audience, including those with applications in queueing, operations research, computational finance, mathematical programming, partial differential equations (both deterministic and stochastic), and particle transport, as well as to probabilists and statisticians wanting to know how to apply effectively a powerful tool, and to those interested in numerical integration or optimization in their own right. It recognizes that the heart of practical application is algorithms, so pseudocodes appear throughout the book. While not primarily a textbook, it is suitable as a supplementary text for certain graduate courses. As a reference, it belongs on the shelf of everyone with a serious interest in improving simulation efficiency. Moreover, it will be a valuable reference to all those individuals interested in improving simulation efficiency with more than incremental increases.

Transportation scientists are motivated by the desire to explain spatial interactions that result in movement of people or objects from place to place. Its methodologies draw from physics, operations research, probability and control theory. It is fundamentally a quantitative discipline, relying on mathematical models and optimization algorithms to explain the phenomena of transportation. The fourteen chapters in the handbook are written by the leading researchers in transportation science in an effort to define and categorize for the first time the scientific nature and state of the art of the field. As such, it is directed to the broader research community, transportation practitioners, and future transportation scientists.

The work of major research scholars in this field comprises the individual chapters of Computational Probability. The first chapter describes, in nonmathematical terms, the challenges in computational probability. Chapter 2 describes the methodologies available for obtaining the transition matrices for Markov chains, with particular emphasis on stochastic Petri-nets. Chapter 3 discusses how to find transient probabilities and transient rewards for these Markov chains. The next two chapters indicate how to find steady-state probabilities for Markov chains with a finite number of states. Both direct and iterative methods are described in Chapter 4. Details of these methods are given in Chapter 5. Chapters 6 and 7 deal with infinite-state Markov chains, which occur frequently in queueing, because there are times one does not want to set a bound for all queues. Chapter 8 deals with transforms, in particular Laplace transforms. The work of Ward Whitt and his collaborators, who have recently developed a number of numerical methods for Laplace transform inversions, is emphasized in this chapter. Finally, if one wants to optimize a system, one way to do the optimization is through Markov decision making, described in Chapter 9. Markov modeling has found applications in many areas, three of which are described in detail: Chapter 10 analyzes discrete-time queues, Chapter 11 describes networks of queues, and Chapter 12 deals with reliability theory.

The book concentrates on the basic principles in the domain of discrete multicriterion analysis, and examines each of these principles in terms of their properties and their implications. In multicriterion decision analysis, any optimum in the strict sense of the term does not exist. Rather, multicriterion decision making utilizes tools, methods, and thinking to examine several solutions, each having their advantages and disadvantages, depending on one's point of view. Actually, various methods exist for reaching a good choice in a multicriterion setting and even a complete ranking of the alternatives. The book describes and compares these methods, so-called `aggregation methods', with their advantages and their shortcomings. Clearly, organizations are becoming more complex, and it is becoming harder and harder to disregard complexity of points of view, motivations, and objectives. The day of the single objective (profit, social environment, etc. ) is over and the wishes of all those involved in all their diversity must be taken into account. To do this, a basic knowledge of multicriterion decision analysis is necessary. The objective of this book is to supply that knowledge and enable it to be applied.

The book is intended for use by practitioners (managers, consultants), researchers, and students in engineering and business.

The Handbook of Semidefinite Programming offers an advanced and broad overview of the current state of the field. It contains nineteen chapters written by the leading experts on the subject. The chapters are organized in three parts: Theory, Algorithms, and Applications and Extensions.

The book includes research and application discussions on topics such as accounting for previous experience; the `learning-forgetting-relearning' phenomenon; parameter estimation with no previous experience; DeJong's incompressibility model; predictive learning models requiring only two learning parameters; long learning cycle times; the speed-error relationship; evaluating the cost of learning from the point of view of safety; and an examination of Learning Organizations. Each chapter is developed from published research and worked examples are used throughout.

The book is edited by Professor J. Scott Armstrong of the Wharton School, University of Pennsylvania. Contributions were written by 40 leading experts in forecasting, and the 30 chapters cover all types of forecasting methods. There are judgmental methods such as Delphi, role-playing, and intentions studies. Quantitative methods include econometric methods, expert systems, and extrapolation. Some methods, such as conjoint analysis, analogies, and rule-based forecasting, integrate quantitative and judgmental procedures. In each area, the authors identify what is known in the form of `if-then principles', and they summarize evidence on these principles.

The project, developed over a four-year period, represents the first book to summarize all that is known about forecasting and to present it so that it can be used by researchers and practitioners. To ensure that the principles are correct, the authors reviewed one another's papers. In addition, external reviews were provided by more than 120 experts, some of whom reviewed many of the papers. The book includes the first comprehensive forecasting dictionary.

This book is organized in three parts. Part I introduces queueing networks with blocking and various application examples. Part II deals with exact and approximate analysis of queueing networks with blocking and the condition under which the various techniques can be applied. Part III presents a review of various properties of networks with blocking, describing several equivalence properties both between networks with and without blocking and between different blocking types. Approximate solution methods for the buffer allocation problem are presented.

Intelligent Strategies for Meta Multiple Criteria Decision-Making deals centrally with the problem of the numerous MCDM methods that can be applied to a decision problem. The book refers to this as a `meta decision problem', and it is this problem that the book analyzes. The author provides two strategies to help the decision-makers select and design an appropriate approach to a complex decision problem. Either of these strategies can be designed into a decision support system itself. One strategy is to use machine learning to design an MCDM method. This is accomplished by applying intelligent techniques, namely neural networks as a structure for approximating functions and evolutionary algorithms as universal learning methods. The other strategy is based on solving the meta decision problem interactively by selecting or designing a method suitable to the specific problem, for example, the constructing of a method from building blocks. This strategy leads to a concept of MCDM networks. Examples of this approach for a decision support system explain the possibilities of applying the elaborated techniques and their mutual interplay. The techniques outlined in the book can be used by researchers, students, and industry practitioners to better model and select appropriate methods for solving complex, multi-objective decision problems.

The first section of this volume discusses game-theoretic applications in four functional areas of business: finance, accounting, operations management and information systems, and organization design. The second section considers competitive strategies in `imperfect' markets. Using cooperative and non-cooperative game-theoretic approaches, these four chapters consider various topics: spatial competition, signaling of product quality, trust and cooperation in ongoing relationships, strategic behavior in bargaining, and the `balance of power' between the firm and its buyers and suppliers. The last section of the book deals in detail with auctions and competitive bidding institutions. The emphasis is on the contributions of game theory to both auction theory and practice. Topics considered include optimal auctions, bidder collusion, and the design of institutions for selling the radio spectrum and trading electrical power.

Because of the unit commitment problem's size and complexity and because of the large economic benefits that could result from its improved solution, considerable attention has been devoted to algorithm development in the book. More systematic procedures based on a variety of widely researched algorithms have been proposed and tested. These techniques have included dynamic programming, branch-and-bound mixed integer programming (MIP), linear and network programming approaches, and Benders decomposition methods, among others. Recently, metaheuristic methods have been tested, such as genetic programming and simulated annealing, along with expert systems and neural networks. Because electric markets are changing rapidly, how UC models are solved and what purposes they serve need reconsideration. Hence, the book brings together people who understand the problem and people who know what improvements in algorithms are really possible. The two-fold result in The Next Generation of Electric Power Unit Commitment Models is an assessment of industry needs and new formulations and computational approaches that promise to make unit commitment models more responsive to those needs.

The book is carefully written. Specific examples and concrete algorithms precede more abstract topics. Topics are clearly developed with a large number of numerical examples worked out in detail.

Moreover, Linear Programming: Foundations and Extensions underscores the purpose of optimization: to solve practical problems on a computer. Accordingly, the book is coordinated with free efficient C programs that implement the major algorithms studied:

-The two-phase simplex method; -The primal-dual simplex method; -The path-following interior-point method; -The homogeneous self-dual methods.

In addition, there are online JAVA applets that illustrate various pivot rules and variants of the simplex method, both for linear programming and for network flows. These C programs and JAVA tools can be found on the book's webpage: . Also, check the book's webpage for new online instructional tools and exercises that have been added in the new edition.