Hybrid Optimization focuses on the application of artificial intelligence and operations research techniques to constraint programming for solving combinatorial optimization problems. This book covers the most relevant topics investigated in the last ten years by leading experts in the field, and speculates about future directions for research. This book includes contributions by experts from different but related areas of research including constraint programming, decision theory, operations research, SAT, artificial intelligence, as well as others. These diverse perspectives are actively combined and contrasted in order to evaluate their relative advantages. This volume presents techniques for hybrid modeling, integrated solving strategies including global constraints, decomposition techniques, use of relaxations, and search strategies including tree search local search and metaheuristics. Various applications of the techniques presented as well as supplementary computational tools are also discussed.

This new edition of Stochastic Linear Programming: Models, Theory and Computation has been brought completely up to date, either dealing with or at least referring to new material on models and methods, including DEA with stochastic outputs modeled via constraints on special risk functions (generalizing chance constraints, ICC's and CVaR constraints), material on Sharpe-ratio, and Asset Liability Management models involving CVaR in a multi-stage setup. To facilitate use as a text, exercises are included throughout the book, and web access is provided to a student version of the authors' SLP-IOR software. Additionally, the authors have updated the Guide to Available Software, and they have included newer algorithms and modeling systems for SLP. The book is thus suitable as a text for advanced courses in stochastic optimization, and as a reference to the field. From Reviews of the First Edition: "The book presents a comprehensive study of stochastic linear optimization problems and their applications. ... The presentation includes geometric interpretation, linear programming duality, and the simplex method in its primal and dual forms. ... The authors have made an effort to collect ... the most useful recent ideas and algorithms in this area. ... A guide to the existing software is included as well." (Darinka Dentcheva, Mathematical Reviews, Issue 2006 c) "This is a graduate text in optimisation whose main emphasis is in stochastic programming. The book is clearly written. ... This is a good book for providing mathematicians, economists and engineers with an almost complete start up information for working in the field. I heartily welcome its publication. ... It is evident that this book will constitute an obligatory reference source for the specialists of the field." (Carlos Narciso Bouza Herrera, Zentralblatt MATH, Vol. 1104 (6), 2007)

In 2014, winner of "Outstanding Book Award" by The Japan Society for Fuzzy Theory and Intelligent Informatics. Covering in detail both theoretical and practical perspectives, this book is a self-contained and systematic depiction of current fuzzy stochastic optimization that deploys the fuzzy random variable as a core mathematical tool to model the integrated fuzzy random uncertainty. It proceeds in an orderly fashion from the requisite theoretical aspects of the fuzzy random variable to fuzzy stochastic optimization models and their real-life case studies. The volume reflects the fact that randomness and fuzziness (or vagueness) are two major sources of uncertainty in the real world, with significant implications in a number of settings. In industrial engineering, management and economics, the chances are high that decision makers will be confronted with information that is simultaneously probabilistically uncertain and fuzzily imprecise, and optimization in the form of a decision must be made in an environment that is doubly uncertain, characterized by a co-occurrence of randomness and fuzziness. This book begins by outlining the history and development of the fuzzy random variable before detailing numerous optimization models and applications that include the design of system controls for a dam.

This volume presents a collection of contributions dedicated to applied problems in the financial and energy sectors that have been formulated and solved in a stochastic optimization framework. The invited authors represent a group of scientists and practitioners, who cooperated in recent years to facilitate the growing penetration of stochastic programming techniques in real-world applications, inducing a significant advance over a large spectrum of complex decision problems. After the recent widespread liberalization of the energy sector in Europe and the unprecedented growth of energy prices in international commodity markets, we have witnessed a significant convergence of strategic decision problems in the energy and financial sectors. This has often resulted in common open issues and has induced a remarkable effort by the industrial and scientific communities to facilitate the adoption of advanced analytical and decision tools. The main concerns of the financial community over the last decade have suddenly penetrated the energy sector inducing a remarkable scientific and practical effort to address previously unforeseeable management problems. Stochastic Optimization Methods in Finance and Energy: New Financial Products and Energy Markets Strategies aims to include in a unified framework for the first time an extensive set of contributions related to real-world applied problems in finance and energy, leading to a common methodological approach and in many cases having similar underlying economic and financial implications. Part 1 of the book presents 6 chapters related to financial applications; Part 2 presents 7 chapters on energy applications; and Part 3 presents 5 chapters devoted to specific theoretical and computational issues.

This handbook covers DEA topics that are extensively used and solidly based. The purpose of the handbook is to (1) describe and elucidate the state of the field and (2), where appropriate, extend the frontier of DEA research. It defines the state-of-the-art of DEA methodology and its uses. This handbook is intended to represent a milestone in the progression of DEA. Written by experts, who are generally major contributors to the topics to be covered, it includes a comprehensive review and discussion of basic DEA models, which, in the present issue extensions to the basic DEA methods, and a collection of DEA applications in the areas of banking, engineering, health care, and services. The handbook's chapters are organized into two categories: (i) basic DEA models, concepts, and their extensions, and (ii) DEA applications. First edition contributors have returned to update their work.

The second edition includes updated versions of selected first edition chapters. New chapters have been added on: different approaches with no need for a priori choices of weights (called multipliers) that reflect meaningful trade-offs, construction of static and dynamic DEA technologies, slacks-based model and its extensions, DEA models for DMUs that have internal structures network DEA that can be used for measuring supply chain operations, Selection of DEA applications in the service sector with a focus on building a conceptual framework, research design and interpreting results.

"

Approximation theory and numerical analysis are central to the creation of accurate computer simulations and mathematical models. Research in these areas can influence the computational techniques used in a variety of mathematical and computational sciences.

This collection of contributed chapters, dedicated to renowned mathematician Gradimir V. Milovanovi, represent the recent work of experts in the fields of approximation theory and numerical analysis. These invited contributions describe new trends in these important areas of research including theoretic developments, new computational algorithms, and multidisciplinary applications.

Special features of this volume:

- Presents results and approximation methods in various computational settings including: polynomial and orthogonal systems, analytic functions, and differential equations.

- Provides a historical overview of approximation theory and many of its subdisciplines;

- Contains new results from diverse areas of research spanning mathematics, engineering, and the computational sciences.

"Approximation and Computation" is intended for mathematicians and researchers focusing on approximation theory and numerical analysis, but can also be a valuable resource to students and researchers in the computational and applied sciences."

This proceedings volume contains a selection of papers presented at the Fourth International Conference on High Performance Scientific Computing held at the Hanoi Institute of Mathematics, Vietnamese Academy of Science and Technology (VAST), March 2-6, 2009. The conference was organized by the Hanoi Institute of Mathematics, the Interdisciplinary Center for Scientific Computing (IWR), Heidelberg, and its Heidelberg Graduate School of Mathematical and Computational Methods for the Sciences, and Ho Chi Minh City University of Technology. The contributions cover the broad interdisciplinary spectrum of scientific computing and present recent advances in theory, development of methods, and applications in practice. Subjects covered are mathematical modelling, numerical simulation, methods for optimization and control, parallel computing, software development, applications of scientific computing in physics, mechanics, biology and medicine, engineering, hydrology problems, transport, communication networks, production scheduling, industrial and commercial problems.

This work results from my interest in the field of vector optimiza tion. I stumbled first upon this subject in 1982 during my six months visit to the Istituto di Elaborazione della Informazione in Pisa, Italy, supported by a fellowship of the (Italian) Consiglio Nationale delle Richerche. I was attracted then by a gap between vector optimiza tion used to serve as a formal model for multiple objective decision problems and the decision problems themselves, the gap nonexis tent in scalar optimization. Roughly speaking, vector optimization provides methods for ranking decisions according to a partial order whereas decision making requires a linear ordering of decisions. The book deals with vector optimization. However, vector opti mization is considered here not only as a topic of research in itself but also as a basic tool for decision making. In consequence, all results presented here are aimed at exploiting and understanding the structure of elements (decisions) framed by a vector optimiza tion problem with the underlying assumption that the results should be interpretable in terms and applicable in the context of decision making. Computational tractability of results is therefore of special concern throughout this book. A unified framework for presentation is offered by the Cone Sep aration Technique (CST) founded on the notion of cone separation.

Stochastic hydrology is an essential base of water resources systems analysis, due to the inherent randomness of the input, and consequently of the results. These results have to be incorporated in a decision-making process regarding the planning and management of water systems. It is through this application that stochastic hydrology finds its true meaning, otherwise it becomes merely an academic exercise. A set of well known specialists from both stochastic hydrology and water resources systems present a synthesis of the actual knowledge currently used in real-world planning and management. The book is intended for both practitioners and researchers who are willing to apply advanced approaches for incorporating hydrological randomness and uncertainty into the simulation and optimization of water resources systems. (abstract) Stochastic hydrology is a basic tool for water resources systems analysis, due to inherent randomness of the hydrologic cycle. This book contains actual techniques in use for water resources planning and management, incorporating randomness into the decision making process. Optimization and simulation, the classical systems-analysis technologies, are revisited under up-to-date statistical hydrology findings backed by real world applications.

This book has been written to address the increasing number of Operations Research and Management Science problems (that is, applications) that involve the explicit consideration of time and of gaming among multiple agents. It is a book that will be used both as a textbook and as a reference and guide by those whose work involves the theoretical aspects of dynamic optimization and differential games.

Entropy optimization is a useful combination of classical engineering theory (entropy) with mathematical optimization. The resulting entropy optimization models have proved their usefulness with successful applications in areas such as image reconstruction, pattern recognition, statistical inference, queuing theory, spectral analysis, statistical mechanics, transportation planning, urban and regional planning, input-output analysis, portfolio investment, information analysis, and linear and nonlinear programming. While entropy optimization has been used in different fields, a good number of applicable solution methods have been loosely constructed without sufficient mathematical treatment. A systematic presentation with proper mathematical treatment of this material is needed by practitioners and researchers alike in all application areas. The purpose of this book is to meet this need. Entropy Optimization and Mathematical Programming offers perspectives that meet the needs of diverse user communities so that the users can apply entropy optimization techniques with complete comfort and ease. With this consideration, the authors focus on the entropy optimization problems in finite dimensional Euclidean space such that only some basic familiarity with optimization is required of the reader.

Since the introduction of genetic algorithms in the 1970s, an enormous number of articles together with several significant monographs and books have been published on this methodology. As a result, genetic algorithms have made a major contribution to optimization, adaptation, and learning in a wide variety of unexpected fields. Over the years, many excellent books in genetic algorithm optimization have been published; however, they focus mainly on single-objective discrete or other hard optimization problems under certainty. There appears to be no book that is designed to present genetic algorithms for solving not only single-objective but also fuzzy and multiobjective optimization problems in a unified way. Genetic Algorithms And Fuzzy Multiobjective Optimization introduces the latest advances in the field of genetic algorithm optimization for 0-1 programming, integer programming, nonconvex programming, and job-shop scheduling problems under multiobjectiveness and fuzziness. In addition, the book treats a wide range of actual real world applications. The theoretical material and applications place special stress on interactive decision-making aspects of fuzzy multiobjective optimization for human-centered systems in most realistic situations when dealing with fuzziness. The intended readers of this book are senior undergraduate students, graduate students, researchers, and practitioners in the fields of operations research, computer science, industrial engineering, management science, systems engineering, and other engineering disciplines that deal with the subjects of multiobjective programming for discrete or other hard optimization problems under fuzziness. Real world research applications are used throughout the book to illustrate the presentation. These applications are drawn from complex problems. Examples include flexible scheduling in a machine center, operation planning of district heating and cooling plants, and coal purchase planning in an actual electric power plant.

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. Muhlenbein and Th. Mahnig, Germany). Several further essays address issues or variants of metaheuristics, as well as innovative or successful applications of metaheuristics to classical or new combinatorial optimization problems.

OmeGA: A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems addresses two increasingly important areas in GA implementation and practice. OmeGA, or the ordering messy genetic algorithm, combines some of the latest in competent GA technology to solve scheduling and other permutation problems. Competent GAs are those designed for principled solutions of hard problems, quickly, reliably, and accurately. Permutation and scheduling problems are difficult combinatorial optimization problems with commercial import across a variety of industries. This book approaches both subjects systematically and clearly. The first part of the book presents the clearest description of messy GAs written to date along with an innovative adaptation of the method to ordering problems. The second part of the book investigates the algorithm on boundedly difficult test functions, showing principled scale up as problems become harder and longer. Finally, the book applies the algorithm to a test function drawn from the literature of scheduling.

This book is a compilation of a selected subset of research articles presented at the Eighth INFORMS Computing Society Conference, held in Chandler, Arizona, from January 8 to 10, 2003. The articles in this book represent the diversity and depth of the interface between ORiMS (operations research and the management sciences) and CS/AI (computer science and artificial intelligence ). This volume starts with two papers that represent the reflective and integrative thinking that is critical to any scientific discipline. These two articles present philosophical perspectives on computation, covering a variety of traditional and newer methods for modeling, solving, and explaining mathematical models. The next set includes articles that study machine learning and computational heuristics, and is followed by articles that address issues in performance testing of solution algorithms and heuristics. These two sets of papers demonstrate the richness of thought that takes place at the ORiMS and CSI AI interface. The final set of articles demonstrates the usefulness of these and other methods at the interface towards solving problems in the real world, covering e-commerce, workflow, electronic negotiation, music, parallel computation, and telecommunications. The articles in this collection represent the results of cross-fertilization between ORiMS and CSI AI, making possible advances that could have not been achieved in isolation. The continuing aim ofthe INFORMS Computing Society and this research conference is to invigorate and further develop this interface.

Nonstandard Methods of Analysis is concerned with the main trends in this field; infinitesimal analysis and Boolean-valued analysis. The methods that have been developed in the last twenty-five years are explained in detail, and are collected in book form for the first time. Special attention is paid to general principles and fundamentals of formalisms for infinitesimals as well as to the technique of descents and ascents in a Boolean-valued universe. The book also includes various novel applications of nonstandard methods to ordered algebraic systems, vector lattices, subdifferentials, convex programming etc. that have been developed in recent years. For graduate students, postgraduates and all researchers interested in applying nonstandard methods in their work.

Dynamic Portfolio Strategies: Quantitative Methods and Empirical Rules for Incomplete Information investigates optimal investment problems for stochastic financial market models. It is addressed to academics and students who are interested in the mathematics of finance, stochastic processes, and optimal control, and also to practitioners in risk management and quantitative analysis who are interested in new strategies and methods of stochastic analysis. While there are many works devoted to the solution of optimal investment problems for various models, the focus of this book is on analytical strategies based on "technical analysis" which are model-free. The technical analysis of these strategies has a number of characteristics. Two of the more important characteristics are: (1) they require only historical data, and (2) typically they are more widely used by traders than analysis based on stochastic models. Hence it is the objective of this book to reduce the gap between model-free strategies and strategies that are "optimal" for stochastic models. We hope that researchers, students and practitioners will be interested in some of the new empirically based methods of "technical analysis" strategies suggested in this book and evaluated via stochastic market models.

The last decade has seen a remarkable development of the "Marginal and Moment Problems" as a research area in Probability and Statistics. Its attractiveness stemmed from its lasting ability to provide a researcher with difficult theoretical problems that have direct consequences for appli cations outside of mathematics. The relevant research aims centered mainly along the following lines that very frequently met each other to provide sur prizing and useful results : -To construct a probability distribution (to prove its existence, at least) with a given support and with some additional inner stochastic property defined typically either by moments or by marginal distributions. -To study the geometrical and topological structure of the set of prob ability distributions generated by such a property mostly with the aim to propose a procedure that would result in a stochastic model with some optimal properties within the set of probability distributions. These research aims characterize also, though only very generally, the scientific program of the 1996 conference "Distributions with given marginals and moment problems" held at the beginning of September in Prague, Czech Republic, to perpetuate the tradition and achievements of the closely related 1990 Roma symposium "On Frechet Classes" 1 and 1993 Seattle" AMS Summer Conference on Marginal Problem".

Strategies for Quasi-Monte Carlo builds a framework to design and analyze strategies for randomized quasi-Monte Carlo (RQMC). One key to efficient simulation using RQMC is to structure problems to reveal a small set of important variables, their number being the effective dimension, while the other variables collectively are relatively insignificant. Another is smoothing. The book provides many illustrations of both keys, in particular for problems involving Poisson processes or Gaussian processes. RQMC beats grids by a huge margin. With low effective dimension, RQMC is an order-of-magnitude more efficient than standard Monte Carlo. With, in addition, certain smoothness - perhaps induced - RQMC is an order-of-magnitude more efficient than deterministic QMC. Unlike the latter, RQMC permits error estimation via the central limit theorem. For random-dimensional problems, such as occur with discrete-event simulation, RQMC gets judiciously combined with standard Monte Carlo to keep memory requirements bounded. 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.

This special volume focuses on optimization and control of processes governed by partial differential equations. The contributors are mostly participants of the DFG-priority program 1253: Optimization with PDE-constraints which is active since 2006. The book is organized in sections which cover almost the entire spectrum of modern research in this emerging field. Indeed, even though the field of optimal control and optimization for PDE-constrained problems has undergone a dramatic increase of interest during the last four decades, a full theory for nonlinear problems is still lacking. The contributions of this volume, some of which have the character of survey articles, therefore, aim at creating and developing further new ideas for optimization, control and corresponding numerical simulations of systems of possibly coupled nonlinear partial differential equations. The research conducted within this unique network of groups in more than fifteen German universities focuses on novel methods of optimization, control and identification for problems in infinite-dimensional spaces, shape and topology problems, model reduction and adaptivity, discretization concepts and important applications. Besides the theoretical interest, the most prominent question is about the effectiveness of model-based numerical optimization methods for PDEs versus a black-box approach that uses existing codes, often heuristic-based, for optimization.

Project management has become a widespread instrument enabling organizations to efficiently master the challenges of steadily shortening product life cycles, global markets and decreasing profit margins. With projects increasing in size and complexity, their planning and control represents one of the most crucial management tasks. This is especially true for scheduling, which is concerned with establishing execution dates for the sub-activities to be performed in order to complete the project. The ability to manage projects where resources must be allocated between concurrent projects or even sub-activities of a single project requires the use of commercial project management software packages. However, the results yielded by the solution procedures included are often rather unsatisfactory. Scheduling of Resource-Constrained Projects develops more efficient procedures, which can easily be integrated into software packages by incorporated programming languages, and thus should be of great interest for practitioners as well as scientists working in the field of project management. The book is divided into two parts. In Part I, the project management process is described and the management tasks to be accomplished during project planning and control are discussed. This allows for identifying the major scheduling problems arising in the planning process, among which the resource-constrained project scheduling problem is the most important. Part II deals with efficient computer-based procedures for the resource-constrained project scheduling problem and its generalized version. Since both problems are NP-hard, the development of such procedures which yield satisfactory solutions in a reasonable amount of computation time is very challenging, and a number of new and very promising approaches are introduced. This includes heuristic procedures based on priority rules and tabu search as well as lower bound methods and branch and bound procedures which can be applied for computing optimal solutions.

This book contains translations of papers from the second volume of the new Russian-language journal published at the Sobolev Institute of Mathematics (Sibe- rian Branch of the Russian Academy of Sciences, Novosibirsk) since 1994. In 1994 the journal was titled Sibirskil Zhurnal Issledovaniya Oper- atsil. Since 1995 this journal has the title Diskretny'l Analiz i Issledovanie Operatsi'l (Discrete Analysis and Operations Research). The aim of this journal is to bring together research papers in different areas of discrete mathematics and computer science. The journal DiskretnYl Analiz i Issledovanie Operatsil covers the following fields: * discrete optimization * synthesis and complexity * discrete structures and * of control systems extremal problems * automata * combinatorics * graphs * control and reliability * game theory and its of discrete devices applications * mathematical models and * coding theory methods of decision making * scheduling theory * design and analysis * functional systems theory of algorithms Contributions presented to the journal can be original research papers and occasional survey articles of moderate length. The journal is published in one volume of four issues per year that appear in March, June, September, and December. Each volume contains approximately 400 pages. I express my sincere gratitude to Professor S. S. Kutateladze for his help in editing the English translation.

Data uncertainty is a concept closely related with most real life applications that involve data collection and interpretation. Examples can be found in data acquired with biomedical instruments or other experimental techniques. Integration of robust optimization in the existing data mining techniques aim to create new algorithms resilient to error and noise.

This work encapsulates all the latest applications of robust optimization in data mining. This brief contains an overview of the rapidly growing field ofrobust data mining research field and presents the most well known machine learning algorithms, their robust counterpart formulations and algorithms for attacking these problems.

Thisbrief will appeal to theoreticians and data miners working in this field.

"

H-infinity engineering continues to establish itself as a discipline of applied mathematics. As such, this extensively illustrated monograph makes a significant application of H-infinity theory to electronic amplifier design, demonstrating how recent developments in H-infinity engineering equip amplifier designers with new tools and avenues for research. The presentation, at the interface of applied mathematics and engineering, emphasizes how to (1) compute the best possible performance available from any matching circuits; (2) benchmark existing matching solutions; and (3) generalize results to multiple amplifiers. As the monograph develops, many research directions are pointed out for both disciplines. The physical meaning of a mathematical problem is made explicit for the mathematician, while circuit problems are presented in the H-infinity framework for the engineer. A final chapter organizes these research topics into a collection of open problems ranging from electrical engineering, numerical implementations, and generalizations to H-infinity theory.

Sample-Path Analysis of Queueing Systems uses a deterministic (sample-path) approach to analyze stochastic systems, primarily queueing systems and more general input-output systems. Among other topics of interest it deals with establishing fundamental relations between asymptotic frequencies and averages, pathwise stability, and insensitivity. These results are utilized to establish useful performance measures. The intuitive deterministic approach of this book will give researchers, teachers, practitioners, and students better insights into many results in queueing theory. The simplicity and intuitive appeal of the arguments will make these results more accessible, with no sacrifice of mathematical rigor. Recent topics such as pathwise stability are also covered in this context. The book consistently takes the point of view of focusing on one sample path of a stochastic process. Hence, it is devoted to providing pure sample-path arguments. With this approach it is possible to separate the issue of the validity of a relationship from issues of existence of limits and/or construction of stationary framework. Generally, in many cases of interest in queueing theory, relations hold, assuming limits exist, and the proofs are elementary and intuitive. In other cases, proofs of the existence of limits will require the heavy machinery of stochastic processes. The authors feel that sample-path analysis can be best used to provide general results that are independent of stochastic assumptions, complemented by use of probabilistic arguments to carry out a more detailed analysis. This book focuses on the first part of the picture. It does however, provide numerous examples that invoke stochastic assumptions, which typically are presented at the ends of the chapters.