Методы оптимизации
Математика
  • формат pdf
  • размер 3.18 МБ
  • добавлен 02 февраля 2012 г.
Gerd I. (Ed.) Stochastic Programming: The State of the Art In Honor of George B. Dantzig
Springer – 2011, 362 pages.
ISBN 9781441916419.

The preparation of this book started in 2004, when George B. Dantzig and I, following a long-standing invitation by Fred Hillier to contribute a volume to his Inteational Series in Operations Research and Management Science, decided finally to go ahead with editing a volume on stochastic programming. The field of stochastic programming (also referred to as optimization under uncertainty or planning under uncertainty) had advanced significantly in the last two decades, both theoretically and in practice. George Dantzig and I felt that it would be valuable to showcase some of these advances and to present what one might call the state-of- the-art of the field to a broader audience. We invited researchers whom we considered to be leading experts in various specialties of the field, including a few representatives of promising developments in the making, to write a chapter for the volume. Unfortunately, to the great loss of all of us, George Dantzig passed away on May 13, 2005. Encouraged by many colleagues, I decided to continue with the book and edit it as a volume dedicated to George Dantzig. Management Science published in 2005 a special volume featuring the Ten most Influential Papers of the first 50 Years of Management Science. George Dantzig’s original 1955 stochastic programming paper, Linear Programming under Uncertainty, was featured among these ten. Hearing about this, George Dantzig suggested that his 1955 paper be the first chapter of this book. The vision expressed in that paper gives an important scientific and historical perspective to the book.
Contents:
Linear Programming Under Uncertainty.- A Probabilistic Lower Bound for Two-Stage Stochastic Programs.- Simulation-Based Optimality Tests for Stochastic Programs.- Stochastic Decomposition and Extensions.- Barycentric Bounds in Stochastic Programming: Theory and Application.- Stochastic Programming Apporximations Using Limited Moment Information, with Application to Asset Allocation.- Stability and Scenario Trees for Multistage Stochastic Programs.- Risk Aversion in Two-Stage Stochastic Integer Programming.- Risk-Averse Portfolio Optimization via Stochastic Dominance Constraints.- Single Period Mean-Variance Analysis in a Changing World.- Mean-Absolute Deviation Model.- Multi-Stage Financial Planning Models: Integrating Stochastic Programs and Policy Simulators.- Growth-Security Models and Stochastic Dominance.- Production Planning Under Supply and Demand Uncertainty: A Stochastic Programming Approach.- Global Climate Decisions under Uncertainty.- Control of Diffusions via Linear Programming.
Похожие разделы
Смотрите также

Birge J.R., Louveaux F. Introduction to Stochastic Programming

  • формат pdf
  • размер 4.33 МБ
  • добавлен 02 февраля 2012 г.
Springer – 2011, 510 pages. ISBN: 1461402360. The aim of stochastic programming is to find optimal decisions in problems which involve uncertain data. This field is currently developing rapidly with contributions from many disciplines including operations research, mathematics, and probability. At the same time, it is now being applied in a wide variety of subjects ranging from agriculture to financial planning and from industrial engineering to...

Caric T., Gold H. (eds.) Vehicle Routing Problem

  • формат pdf
  • размер 1.81 МБ
  • добавлен 25 ноября 2011 г.
Издательство InTech, 2008, -152 pp. The Vehicle Routing Problem (VRP) dates back to the end of the fifties of the last century when Dantzig and Ramser set the mathematical programming formulation and algorithmic approach to solve the problem of delivering gasoline to service stations. Since then the interest in VRP evolved from a small group of mathematicians to the broad range of researchers and practitioners, from different disciplines, invol...

Dantzig G., Thapa M. Linear programming. Vol.1. Introduction

  • формат pdf
  • размер 2.13 МБ
  • добавлен 15 декабря 2011 г.
Springer – 1997, 474 pages Linear programming and its generalization, mathematical programming, can be viewed as part of a great revolutionary development that has given mankind the ability to state general goals and lay out a path of detailed decisions to be taken in order to best achieve these goals when faced with practical situations of great complexity. The tools for accomplishing this are the models that formulate real-world problems in det...

Dantzig G., Thapa M. Linear Programming. Vol.2. Theory and extensions

  • формат pdf
  • размер 2.36 МБ
  • добавлен 15 декабря 2011 г.
Springer – 2003, 474 pages Linear Programming 2 continues where Linear Programming 1 left o?. We assume that the reader has an introductory knowledge of linear programming, for example has read Linear Programming 1: Introduction (or its equivalent) and has knowledge of linear algebra (reviewed in the appendices in Linear Programming 1). In this volume, we prove all theorems stated and those that were sketched but not proved in Linear Programming...

Eiselt H.A., Sandblom C.-L. Linear Programming and its Applications

  • формат pdf
  • размер 6.5 МБ
  • добавлен 15 декабря 2011 г.
Publisher: Springer | 2007 | ISBN10: 3540736700 | 380 pages Based on earlier work by a variety of authors in the 1930s and 1940s, the simplex method for solving linear programming problems was developed in 1947 by the American mathematician George B. Dantzig. Helped by the computer revolution, it has been described by some as the overwhelmingly most significant mathematical development of the last century. Owing to the simplex method, linear prog...

Heckman C.C. Linear Programming: Beyond 4.2(Simplex Method)

  • формат pdf
  • размер 128.87 КБ
  • добавлен 01 августа 2009 г.
Article. Department of Mathematics and Statistics, Arizona State University

Kall P. Stochastic Linear Programming: Models, Theory, and Computation

  • формат pdf
  • размер 3.24 МБ
  • добавлен 15 декабря 2011 г.
Publisher: Springer | 2010 | ISBN13: 9781441977281 | 426 pages | 2nd Edition 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-...

Rantzer A., Byrnes C.I. Directions in Mathematical Systems Theory and Optimization

  • формат pdf
  • размер 3.18 МБ
  • добавлен 08 января 2011 г.
Springer, 2003. - 391 pages. This volume provides a compilation of recent contributions on feedback and robust control, modeling, estimation and filtering. They were presented on the occasion of the sixtieth birthday of Anders Lindquist, who has delivered fundamental contributions to the fields of systems, signals and control for more than three decades. His contributions include seminal work on the role of splitting subspaces in stochastic real...

Rao S.S. Engineering optimization: theory and practice

  • формат pdf
  • размер 12.42 МБ
  • добавлен 05 марта 2011 г.
John Wiley & Sons, 2009. 813 p. 4th ed. ISBN 978-0-470-18352-6. Contents. Preface. Introduction to Optimization. Classical Optimization Techniques. Linear Programming I: Simplex Method. Linear Programming II: Additional Topics and Extensions. Nonlinear Programming I: One-Dimensional Minimization Methods. Nonlinear Programming II: Unconstrained Optimization Techniques. Nonlinear Programming III: Constrained Optimization Techniques. Geometric P...

Sniedovich M. Dynamic Programming: Foundations and Principles

  • формат pdf
  • размер 2.91 МБ
  • добавлен 04 июня 2011 г.
CRC, 2010. - 624 p. (Second Edition) Incorporating a number of the author’s recent ideas and examples, Dynamic Programming: Foundations and Principles, Second Edition presents a comprehensive and rigorous treatment of dynamic programming. The author emphasizes the crucial role that modeling plays in understanding this area. He also shows how Dijkstra’s algorithm is an excellent example of a dynamic programming algorithm, despite the impression g...