We discuss modeling in Section There is a fair number of exercises that are given at the end of each chapter. Most of them are intended to deepen the understanding of the subject , or to explore extensions of the theory in the text , as opposed to routine drills. However, several numerical exercises are also included. Starred exercises are supposed to be fairly hard.
|Published (Last):||15 December 2004|
|PDF File Size:||15.14 Mb|
|ePub File Size:||16.34 Mb|
|Price:||Free* [*Free Regsitration Required]|
Dynamic Ideas , Belmont, Massachusetts, The Analytics Edge provides a unified, insightful, modern and entertaining treatment of analytics.
The book covers the science of using data to build models, improve decisions, and ultimately add value to institutions and individuals. The book is a modern and unified introduction to linear optimization linear programming, network flows and integer programming at the PhD level.
It covers, in addition to the classical material, all the recent developments in the field in the last ten years including the development of interior points, large scale optimization models and algorithms and complexity of linear optimization. It emphasizes the underlying geometry, intuition and applications of large scale systems. This book represents a departure from existing textbooks. Rather than covering methodology, the book introduces decision support systems through real world applications, and uses spreadsheets to model and solve problems.
It uses management science techniques statistics, simulation, probabilistic modeling and optimization , but only as tools to facilitate problem solving. The purpose of this book is to provide a unified, insightful, and modern treatment of the theory of integer optimization with an eye towards the future.
We have selected those topics that we feel have influenced the current state of the art and most importantly we feel will affect the future of the field. We depart from earlier treatments of integer optimization by placing significant emphasis on strong formulations, duality, algebra and most importantly geometry. The chapters of the book are logically organized in four parts: Part I: Formulations and relaxations includes Chapters and discusses how to formulate integer optimization problems, how to enhance the formulations to improve the quality of relaxations, how to obtain ideal formulations, the duality of integer optimization and how to solve the resulting relaxations both practically and theoretically.
Part II: Algebra and geometry of integer optimization includes Chapters and develops the theory of lattices, oulines ideas from algebraic geometry that have had an impact on integer optimization, and most importantly discusses the geometry of integer optimization, a key feature of the book. These chapters provide the building blocks for developing algorithms.
Part III: Algorithms for integer optimization includes Chapters and develops cutting plane methods, integral basis methods, enumerative methods and approximation algorithms. The key characteristic of our treatment is that our development of the algorithms is naturally based on the algebraic and geometric developments of Part II. Part IV: Extensions of integer optimization includes Chapters 12 and 13, and treats mixed integer optimization and robust discrete optimization.
Both areas are practically significant as real world problems have very often both continous and discrete variables and have elements of uncertainty that need to be addressed in a tractable manner.
ISBN 13: 9781886529199
Anticycling: lexicography and Blands rule 1C8 7. Network flow prablems ,,.. Finding an initial basic feasible solution 3. Column geometry and the simplex method 7.
Princeton University Library Catalog