Stochastic programming - the science that provides us with tools to design and control stochastic systems with the aid of mathematical programming techniques - lies at the intersection of statistics and mathematical programming. The book Stochastic Programming is a comprehensive introduction to the field and its basic mathematical tools. While the mathematics is of a high level, the developed models offer powerful applications, as revealed by the large number of examples presented. The material ranges form basic linear programming to algorithmic solutions of sophisticated systems problems and applications in water resources and power systems, shipbuilding, inventory control, etc. Audience: Students and researchers who need to solve practical and theoretical problems in operations research, mathematics, statistics, engineering, economics, insurance, finance, biology and environmental protection.

Pairs of compact convex sets arise in the quasidifferential calculus of V.F. Demyanov and A.M. Rubinov as sub- and superdifferentials of quasidifferen- tiable functions (see [26]) and in the formulas for the numerical evaluation of the Aumann-Integral which were recently introduced in a series of papers by R. Baier and F. Lempio (see [4], [5], [10] and [9]) and R. Baier and E.M. Farkhi [6], [7], [8]. In the field of combinatorial convexity G. Ewald et al. [36] used an interesting construction called virtual polytope, which can also be represented as a pair of polytopes for the calculation of the combinatorial Picard group of a fan. Since in all mentioned cases the pairs of compact con- vex sets are not uniquely determined, minimal representations are of special to the existence of minimal pairs of compact importance. A problem related convex sets is the existence of reduced pairs of convex bodies, which has been studied by Chr. Bauer (see [14]).

This book reviews some of today's more complex problems, and reflects some of the important research directions in the field. Twenty-nine authors - largely from Montreal's GERAD Multi-University Research Center and who work in areas of theoretical statistics, applied statistics, probability theory, and stochastic processes - present survey chapters on various theoretical and applied problems of importance and interest to researchers and students across a number of academic domains.

Point-to-point vs. hub-and-spoke. Questions of network design are real and involve many billions of dollars. Yet little is known about optimizing design - nearly all work concerns optimizing flow assuming a given design. This foundational book tackles optimization of network structure itself, deriving comprehensible and realistic design principles. With fixed material cost rates, a natural class of models implies the optimality of direct source-destination connections, but considerations of variable load and environmental intrusion then enforce trunking in the optimal design, producing an arterial or hierarchical net. Its determination requires a continuum formulation, which can however be simplified once a discrete structure begins to emerge. Connections are made with the masterly work of Bendsoe and Sigmund on optimal mechanical structures and also with neural, processing and communication networks, including those of the Internet and the Worldwide Web. Technical appendices are provided on random graphs and polymer models and on the Klimov index.

As its title implies, Advances in Multicriteria Analysis presents the most recent developments in multicriteria analysis and in some of its principal areas of application, including marketing, research and development evaluation, financial planning, and medicine. Special attention is paid to the interaction between multicriteria analysis, decision support systems and preference modeling. The five sections of the book cover: methodology; problem structuring; utility assessment; multi-objective optimisation; real world applications. Audience: Researchers and professionals who are operations researchers, management scientists, computer scientists, statisticians, decision analysts, marketing managers and financial analysts.

Contains case studies from engineering and operations research

Includes commented literature for each chapter

Many problems in science, technology and engineering are posed in the form of operator equations of the first kind, with the operator and RHS approximately known. But such problems often turn out to be ill-posed, having no solution, or a non-unique solution, and/or an unstable solution. Non-existence and non-uniqueness can usually be overcome by settling for generalised' solutions, leading to the need to develop regularising algorithms. The theory of ill-posed problems has advanced greatly since A. N. Tikhonov laid its foundations, the Russian original of this book (1990) rapidly becoming a classical monograph on the topic. The present edition has been completely updated to consider linear ill-posed problems with or without a priori constraints (non-negativity, monotonicity, convexity, etc.). Besides the theoretical material, the book also contains a FORTRAN program library. Audience: Postgraduate students of physics, mathematics, chemistry, economics, engineering. Engineers and scientists interested in data processing and the theory of ill-posed problems.

This collection of challenging and well-designed test problems arising in literature studies also contains a wide spectrum of applications, including pooling/blending operations, heat exchanger network synthesis, homogeneous azeotropic separation, and dynamic optimization and optimal control problems.

In t.lw fHll of !!)!)2, Professor Dr. M. Alt.ar, chairman of tIw newly established dppartnwnt or Managenwnt. wit.h Comput.er Science at thp Homanian -American Univprsity in Bucharest (a private univprsil.y), inl.roducod in t.he curriculum a course on DiffenHltial Equations and Optimal Cont.rol, asking lIS to teach such course. It was an inter8sting challengo, since for t.Iw first tim8 wo had to t8ach such mathemaLical course for st.udents with economic background and interosts. It was a natural idea to sl.m't by looking at pconomic models which were described by differpntial equations and for which problems in (\pcision making dir! ariso. Since many or such models were r!escribed in discret.e timp, wp eleculed to elpvolop in parallel t.he theory of differential equations anel thaI, of discrete-timo systpms aur! also control theory in continuous and discrete time. Tlw jll'eSPlu book is t.he result of our tpaehing px!wripnce wit.h this courge. It is an enlargud version of t.he actllal lectuf(~s where, depending on t.he background of tho St.lI(\('Ilts, not all proofs could be given in detail. We would like to express our grat.itude to tlw Board of the Romanian - American University, personally 1. 0 the Rector, Professor Dr. Ion Smedpscu, for support, encouragement and readinpss to accept advancnd ideas in tho curriculum. fhe authors express t.heir warmest thanks 1.0 Mrs. Monica Stan . Necula for tho oxcellent procC'ssing of t.he manuscript.

This volume summarizes and synthesizes an aspect of research work that has been done in the area of Generalized Convexity over the past few decades. Specifically, the book focuses on V-invex functions in vector optimization that have grown out of the work of Jeyakumar and Mond in the 1990 s. The authors integrate related research into the book and demonstrate the wide context from which the area has grown and continues to grow.

Multiwavelength Optical Networks systematically studies the major research issues in WDM (Wavelength Division Multiplexing) optical networks, such as routing and wavelength assignment, QoS multicast routing, design of logical topologies, and placement of wavelength converters. The book consists of two parts. The first part studies the fundamental concepts and principles of WDM networks. The second part discusses advanced and research issues of WDM networks.
The authors of the book have many years of working experience in the areas of computer networks and network optimization. The book discusses many difficult issues of WDM networks in a very comprehensive way. For each problem, there is a background discussion, and then the mathematical formulation, followed by the solutions.

Operations research often solves deterministic optimization problems based on elegantand conciserepresentationswhereall parametersarepreciselyknown. In the face of uncertainty, probability theory is the traditional tool to be appealed for, and stochastic optimization is actually a signi?cant sub-area in operations research. However, the systematic use of prescribed probability distributions so as to cope with imperfect data is partially unsatisfactory. First, going from a deterministic to a stochastic formulation, a problem may becomeintractable. Agoodexampleiswhengoingfromdeterministictostoch- tic scheduling problems like PERT. From the inception of the PERT method in the 1950's, it was acknowledged that data concerning activity duration times is generally not perfectly known and the study of stochastic PERT was launched quite early. Even if the power of today's computers enables the stochastic PERT to be addressed to a large extent, still its solutions often require simplifying assumptions of some kind. Another di?culty is that stochastic optimization problems produce solutions in the average. For instance, the criterion to be maximized is more often than not expected utility. This is not always a meaningful strategy. In the case when the underlying process is not repeated a lot of times, let alone being one-shot, it is not clear if this criterion is realistic, in particular if probability distributions are subjective. Expected utility was proposed as a rational criterion from ?rst principles by Savage. In his view, the subjective probability distribution was - sically an artefact useful to implement a certain ordering of solutions.

Optimum envelope-constrained filter design is concerned with time-domain synthesis of a filter such that its response to a specific input signal stays within prescribed upper and lower bounds, while minimizing the impact of input noise on the filter output or the impact of the shaped signal on other systems depending on the application. In many practical applications, such as in TV channel equalization, digital transmission, and pulse compression applied to radar, sonar and detection, the soft least square approach, which attempts to match the output waveform with a specific desired pulse, is not the most suitable one. Instead, it becomes necessary to ensure that the response stays within the hard envelope constraints defined by a set of continuous inequality constraints. The main advantage of using the hard envelope-constrained filter formulation is that it admits a whole set of allowable outputs. From this set one can then choose the one which results in the minimization of a cost function appropriate to the application at hand. The signal shaping problems so formulated are semi-infinite optimization problems. This monograph presents in a unified manner results that have been generated over the past several years and are scattered in the research literature. The material covered in the monograph includes problem formulation, numerical optimization algorithms, filter robustness issues and practical examples of the application of envelope constrained filter design. Audience: Postgraduate students, researchers in optimization and telecommunications engineering, and applied mathematicians.

Paul Williams, a leading authority on modeling in integer programming, has written a concise, readable introduction to the science and art of using modeling in logic for integer programming. Written for graduate and postgraduate students, as well as academics and practitioners, the book is divided into four chapters that all avoid the typical format of definitions, theorems and proofs and instead introduce concepts and results within the text through examples. References are given at the end of each chapter to the more mathematical papers and texts on the subject, and exercises are included to reinforce and expand on the material in the chapter. Methods of solving with both logic and IP are given and their connections are described. Applications in diverse fields are discussed, and Williams shows how IP models can be expressed as satisfiability problems and solved as such.

Computing has become essential for the modeling, analysis, and optimization of systems. This book is devoted to algorithms, computational analysis, and decision models. The chapters are organized in two parts: optimization models of decisions and models of pricing and equilibria.
Optimization is at the core of rational decision making. Even when the decision maker has more than one goal or there is significant uncertainty in the system, optimization provides a rational framework for efficient decisions. The Markowitz mean-variance formulation is a classical example. The first part of the book is on recent developments in optimization decision models for finance and economics. The first four chapters of this part focus directly on multi-stage problems in finance. Chapters 5-8 involve the use of worst-case robust analysis. Chapters 9-11 are devoted to portfolio optimization. The final four chapters are on transportation-inventory with stochastic demand; optimal investment with CRRA utility; hedging financial contracts; and, automatic differentiation for computational finance.
The uncertainty associated with prediction and modeling constantly requires the development of improved methods and models. Similarly, as systems strive towards equilibria, the characterization and computation of equilibria assists analysis and prediction. The second part of the book is devoted to recent research in computational tools and models of equilibria, prediction, and pricing. The first three chapters of this part consider hedging issues in finance. Chapters 19-22 consider prediction and modeling methodologies. Chapters 23-26 focus on auctions and equilibria. Volatility models are investigated in chapters 27-28. The final two chapters investigate risk assessment and product pricing.
Audience: Researchers working in computational issues related to economics, finance, and management science.

System Modeling and Optimization is an indispensable reference for anyone interested in the recent advances in these two disciplines. The book collects, for the first time, selected articles from the 21st and most recent IFIP TC 7 conference in Sophia Antipolis, France.

Applied mathematicians and computer scientists can attest to the ever-growing influence of these two subjects. The practical applications of system modeling and optimization can be seen in a number of fields: environmental science, transport and telecommunications, image analysis, free boundary problems, bioscience, and non-cylindrical evolution control, to name just a few.

New developments in each of these fields have contributed to a more complex understanding of both system modeling and optimization. Editors John Cagnol and Jean-Paul Zol sio, chairs of the conference, have assembled System Modeling and Optimization to present the most up-to-date developments to professionals and academics alike.

The problem of "Shortest Connectivity," which is discussed here, has a long and convoluted history. Many scientists from many fields as well as laymen have stepped on its stage. Usually, the problem is known as Steiner's Problem and it can be described more precisely in the following way: Given a finite set of points in a metric space, search for a network that connects these points with the shortest possible length. This shortest network must be a tree and is called a Steiner Minimal Tree (SMT). It may contain vertices different from the points which are to be connected. Such points are called Steiner points. Steiner's Problem seems disarmingly simple, but it is rich with possibilities and difficulties, even in the simplest case, the Euclidean plane. This is one of the reasons that an enormous volume of literature has been published, starting in 1 the seventeenth century and continuing until today. The difficulty is that we look for the shortest network overall. Minimum span ning networks have been well-studied and solved eompletely in the case where only the given points must be connected. The novelty of Steiner's Problem is that new points, the Steiner points, may be introduced so that an intercon necting network of all these points will be shorter. This also shows that it is impossible to solve the problem with combinatorial and geometric methods alone."

Continuous optimization is the study of problems in which we wish to opti mize (either maximize or minimize) a continuous function (usually of several variables) often subject to a collection of restrictions on these variables. It has its foundation in the development of calculus by Newton and Leibniz in the 17* DEGREES century. Nowadys, continuous optimization problems are widespread in the mathematical modelling of real world systems for a very broad range of applications. Solution methods for large multivariable constrained continuous optimiza tion problems using computers began with the work of Dantzig in the late 1940s on the simplex method for linear programming problems. Recent re search in continuous optimization has produced a variety of theoretical devel opments, solution methods and new areas of applications. It is impossible to give a full account of the current trends and modern applications of contin uous optimization. It is our intention to present a number of topics in order to show the spectrum of current research activities and the development of numerical methods and applications."

This book concentrates on providing technical tools to make the user of Multiple Criteria Decision Making (MCDM) methodologies independent of bulky optimization computations. These bulky computations have been a necessary, but limiting, characteristic of interactive MCDM methodologies and algorithms. The book removes these limitations of MCDM problems by reducing a problem's computational complexity. The result is a wider and more functional general framework for presenting, teaching, implementing and applying a wide range of MCDM methodologies.

This book is a comprehensive survey of the mathematical concepts and principles of industrial mathematics. Its purpose is to provide students and professionals with an understanding of the fundamental mathematical principles used in Industrial Mathematics/OR in modeling problems and application solutions. All the concepts presented in each chapter have undergone the learning scrutiny of the author and his students. The illustrative material throughout the book was refined for student comprehension as the manuscript developed through its iterations, and the chapter exercises are refined from the previous year's exercises.

This book deals with the theory and applications of the Reformulation- Linearization/Convexification Technique (RL T) for solving nonconvex optimization problems. A unified treatment of discrete and continuous nonconvex programming problems is presented using this approach. In essence, the bridge between these two types of nonconvexities is made via a polynomial representation of discrete constraints. For example, the binariness on a 0-1 variable x . can be equivalently J expressed as the polynomial constraint x . (1-x . ) = 0. The motivation for this book is J J the role of tight linear/convex programming representations or relaxations in solving such discrete and continuous nonconvex programming problems. The principal thrust is to commence with a model that affords a useful representation and structure, and then to further strengthen this representation through automatic reformulation and constraint generation techniques. As mentioned above, the focal point of this book is the development and application of RL T for use as an automatic reformulation procedure, and also, to generate strong valid inequalities. The RLT operates in two phases. In the Reformulation Phase, certain types of additional implied polynomial constraints, that include the aforementioned constraints in the case of binary variables, are appended to the problem. The resulting problem is subsequently linearized, except that certain convex constraints are sometimes retained in XV particular special cases, in the Linearization/Convexijication Phase. This is done via the definition of suitable new variables to replace each distinct variable-product term. The higher dimensional representation yields a linear (or convex) programming relaxation.

Optimization methods have been considered in many articles, monographs, and handbooks. However, experts continue to experience difficulties in correctly stating optimization problems in engineering. These troubles typically emerge when trying to define the set of feasible solutions, i.e. the constraints imposed on the design variables, functional relationships, and criteria. The Parameter Space Investigation (PSI) method was developed specifically for the correct statement and solution of engineering optimization problems. It is implemented in the MOVI 1.0 software package, a tutorial version of which is included in this book. The PSI method and MOVI 1.0 software package have a wide range of applications. The PSI method can be successfully used for the statement and solution of the following multicriteria problems: design, identification, design with control, the optional development of prototypes, finite element models, and the decomposition and aggregation of large-scale systems.

Audience: The PSI method will be of interest to researchers, graduate students, and engineers who work in engineering, mathematical modelling and industrial mathematics, and in computer and information science.

This work examines all the fuzzy multicriteria methods recently developed, such as fuzzy AHP, fuzzy TOPSIS, interactive fuzzy multiobjective stochastic linear programming, fuzzy multiobjective dynamic programming, grey fuzzy multiobjective optimization, fuzzy multiobjective geometric programming, and more. Each of the 22 chapters includes practical applications along with new developments/results.
This book may be used as a textbook in graduate operations research, industrial engineering, and economics courses. It will also be an excellent resource, providing new suggestions and directions for further research, for computer programmers, mathematicians, and scientists in a variety of disciplines where multicriteria decision making is needed.

Since I started working in the area of nonlinear programming and, later on, variational inequality problems, I have frequently been surprised to find that many algorithms, however scattered in numerous journals, monographs and books, and described rather differently, are closely related to each other. This book is meant to help the reader understand and relate algorithms to each other in some intuitive fashion, and represents, in this respect, a consolidation of the field. The framework of algorithms presented in this book is called Cost Approxi mation. (The preface of the Ph.D. thesis Pat93d] explains the background to the work that lead to the thesis, and ultimately to this book.) It describes, for a given formulation of a variational inequality or nonlinear programming problem, an algorithm by means of approximating mappings and problems, a principle for the update of the iteration points, and a merit function which guides and monitors the convergence of the algorithm. One purpose of this book is to offer this framework as an intuitively appeal ing tool for describing an algorithm. One of the advantages of the framework, or any reasonable framework for that matter, is that two algorithms may be easily related and compared through its use. This framework is particular in that it covers a vast number of methods, while still being fairly detailed; the level of abstraction is in fact the same as that of the original problem statement."

Invexity and Optimization presents results on invex function and their properties in smooth and nonsmooth cases, pseudolinearity and eta-pseudolinearity. Results on optimality and duality for a nonlinear scalar programming problem are presented, second and higher order duality results are given for a nonlinear scalar programming problem, and saddle point results are also presented. Invexity in multiobjective programming problems and Kuhn-Tucker optimality conditions are given for a multiobjecive programming problem, Wolfe and Mond-Weir type dual models are given for a multiobjective programming problem and usual duality results are presented in presence of invex functions. Continuous-time multiobjective problems are also discussed. Quadratic and fractional programming problems are given for invex functions. Symmetric duality results are also given for scalar and vector cases.