الصفحة 1
الصفحة 1
Introduction to Computational Optimization Models for Production Planning in a Supply Chain
In this book we strive to provide models that capture many of the - tails faced by ?rms operating in a modern supply chain, but we stop short of proposing models for economic analysis of the entire multi-player chain. In other words, we produce models that are useful for planning within a supply chain rather than models for planning the supply chain. The usefulness of the models is enhanced greatly by the fact that they have been implemented - ing computer modeling languages. Implementations are shown in Chapter 7, which allows solutions to be found using a computer.
Introduction to Algorithms
Combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor. The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming.
Interior Point Methods for Linear Optimization
Linear Optimization (LO) is one of the most widely applied and taught techniques in mathematics, with applications in many areas of science, commerce and industry. The dramatically increased interest in the subject is due mainly to advances in computer technology and the development of Interior Point Methods (IPMs) for LO. This book provides a unified presentation of the field. The authors present a self-contained comprehensive interior point approach to both the theory of LO and algorithms for LO (design, convergence, complexity, asymptotic behaviour and computational issues). A common thread throughout the book is the role of strictly complementary solutions, which play a crucial role in the interior point approach and distinguishes the new approach from the classical Simplex-based approach
Information Processing in Medical Imaging ; 20th International Conference, IPMI 2007, Kerkrade, The Netherlands, July 2-6, 2007, Proceedings
The 20th International Conference on Information Processing in Medical Im- ing(IPMI)washeldduringJuly2–6,2007,atRolducAbbey,locatedinKerkrade in the south of the Netherlands. IPMI is one of the longest running conferences in medical imaging.
Fuzzy multi-criteria decision making : Theory and applications with recent developments
In trying to make a satisfactory decision when imprecise and multicriteria situations are involved, a decision maker has to use a fuzzy multicriteria decision making method. Fuzzy Multi-Criteria Decision Making (MCDM) presents fuzzy multiattribute and multiobjective decision-making methodologies by distinguished MCDM researchers. In summarizing the concepts and results of the most popular fuzzy multicriteria methods, using numerical examples, 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.
Fuzzy mathematical programming and fuzzy matrix games
This book presents a systematic and focused study of the application of fuzzy sets to two basic areas of decision theory, namely Mathematical Programming and Matrix Game Theory. Apart from presenting most of the basic results available in the literature on these topics, the emphasis is on understanding their natural relationship in a fuzzy environment
Decomposition Techniques in Mathematical Programming : Engineering and Science Applications
This textbook for students and practitioners presents a practical approach to decomposition techniques in optimization. It provides an appropriate blend of theoretical background and practical applications in engineering and science, which makes the book interesting for practitioners, as well as engineering, operations research and applied economics graduate and postgraduate students. "Decomposition Techniques in Mathematical Programming" is based on clarifying, illustrative and computational examples and applications from electrical, mechanical, energy and civil engineering as well as applied mathematics and economics. It addresses decomposition in linear programming, mixed-integer linear programming, nonlinear programming, and mixed-integer nonlinear programming, and provides rigorous decomposition algorithms as well as heuristic ones.
Decision Support for Forest Management
While earlier books concerning forest planning have tended to focus on linear programming, economic aspects, or specific multi-criteria decision aid tools, this book provides a much broader range of tools to meet a variety of planning situations. The methods themselves cover a range of decision situations – from cases involving single decision makers, through group decision making, to participatory planning. They include traditional decision support tools, from optimization to utility functions, as well as methods that are just gaining ground in forest planning – such as problem structuring methods and social choice theory. Including examples which illustrate the application of each technique to specific management planning problems, the book offers an invaluable resource for both researchers and advanced students specializing in management and planning issues relating to forestry.
Mathematical Formulas for Economists
This collection of formulas constitutes a compendium of mathematics for eco nomics and business. It contains the most important formulas, statements and algorithms in this significant subfield of modern mathematics and addresses primarily students of economics or business at universities, colleges and trade schools. But people dealing with practical or applied problems will also find this collection to be an efiicient and easy-to-use work of reference. First the book treats mathematical symbols and constants, sets and state ments, number systems and their arithmetic as well as fundamentals of com binatorics. The chapter on sequences and series is followed by mathematics of finance, the representation of functions of one and several independent vari ables, their differential and integral calculus and by differential and difference equations. In each case special emphasis is placed on applications and models in economics. The chapter on linear algebra deals with matrices, vectors, determinants and systems of linear equations. This is followed by the representation of struc tures and algorithms of linear programming. Finally, the reader finds formu las on descriptive statistics (data analysis, ratios, inventory and time series analysis), on probability theory (events, probabilities, random variables and distributions) and on inductive statistics (point and interval estimates, tests). Some important tables complete the work.
Linear Programming and its Applications
This book presents a unified treatment of linear programming. Without sacrificing mathematical rigor, the main emphasis of the book is on models and applications. The most important classes of problems are surveyed and presented by means of mathematical formulations, followed by solution methods and a discussion of a variety of "what-if" scenarios. Non-simplex based solution methods and newer developments such as interior point methods are covered along with a variety of approaches that incorporate multiple objectives in the model.
Linear Programming : Foundations and Extensions
Linear Programming: Foundations and Extensions is an introduction to the field of optimization. The book emphasizes constrained optimization, beginning with a substantial treatment of linear programming, and proceeding to convex analysis, network flows, integer programming, quadratic programming, and convex optimization. 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.
Linear Optimization Problems with Inexact Data
Linear programming attracted the interest of mathematicians during and after World War II when the first computers were constructed and methods for solving large linear programming problems were sought in connection with specific practical problems—for example, providing logistical support for the U.S. Armed Forces or modeling national economies. Early attempts to apply linear programming methods to solve practical problems failed to satisfy expectations. There were various reasons for the failure. One of them, which is the central topic of this book, was the inexactness of the data used to create the models. This phenomenon, inherent in most pratical problems, has been dealt with in several ways. At first, linear programming models used "average” values of inherently vague coefficients, but the optimal solutions of these models were not always optimal for the original problem itself. Later researchers developed the stochastic linear programming approach, but this too has its limitations. Recently, interest has been given to linear programming problems with data given as intervals, convex sets and/or fuzzy sets. The individual results of these studies have been promising, but the literature has not presented a unified theory. Linear Optimization Problems with Inexact Data attempts to present a comprehensive treatment of linear optimization with inexact data, summarizing existing results and presenting new ones within a unifying framework.
Linear and Nonlinear Programming
"Linear and Nonlinear Programming" is considered a classic textbook in Optimization. While it is a classic, it also reflects modern theoretical insights. These insights provide structure to what might otherwise be simply a collection of techniques and results, and this is valuable both as a means for learning existing material and for developing new results. One major insight of this type is the connection between the purely analytical character of an optimization problem, expressed perhaps by properties of the necessary conditions, and the behavior of algorithms used to solve a problem. This was a major theme of the first and second editions. Now the third edition has been completely updated with recent Optimization Methods. Yinyu Ye has written chapters and chapter material on a number of these areas including Interior Point Methods.
Languages and Compilers for Parallel Computing ; 21th International Workshop, LCPC 2008, Edmonton, Canada, July 31 - August 2, 2008, Revised Selected Papers
This book constitutes the thoroughly refereed post-conference proceedings of the 21th International Workshop on Languages and Compilers for Parallel Computing, LCPC 2008, held in Edmonton, Canada, in July/August 2008.The 18 revised full papers and 6 revised short papers presented were carefully reviewed and selected from 35 submissions. The papers address all aspects of languages, compiler techniques, run-time environments, and compiler-related performance evaluation for parallel and high-performance computing and comprise
Complex Scheduling
This book deals with such complex scheduling problems and methods to solve them. It consists of three parts: The ?rst part (Chapters 1 and 2) contains a description of basic scheduling models with applications and an introduction into discrete optimization (covering complexity, shortest path algorithms, linear programming, network ?ow algorithms and general optimization methods). In the second part (Chapter 3) resource-constrained project scheduling problems are considered. Especially, methods like constraint propagation, branch-a- bound algorithms and heuristic procedures are described. Furthermore, lower bounds and general objective functions are discussed.
Beyond the Worst-Case Analysis of Algorithms
There are no silver bullets in algorithm design, and no single algorithmic idea is powerful and flexible enough to solve every computational problem. Nor are there silver bullets in algorithm analysis, as the most enlightening method for analyzing an algorithm often depends on the problem and the application. However, typical algorithms courses rely almost entirely on a single analysis framework, that of worst-case analysis, wherein an algorithm is assessed by its worst performance on any input of a given size. The purpose of this book is to popularize several alternatives to worst-case analysis and their most notable algorithmic applications, from clustering to linear programming to neural network training. Forty leading researchers have contributed introductions to different facets of this field, emphasizing the most important models and results, many of which can be taught in lectures to beginning graduate students in theoretical computer science and machine learning.
