Stochastic Programming Algorithms And Models

A computationally oriented comparison of solution algorithms for two stage and jointly chance constrained stochastic linear programming problems, this is the first book to present comparative computational results with several major stochastic programming solution approaches. The following methods are considered: regularized decomposition, stochastic decomposition and successive discrete approximation methods for two stage problems; cutting plane methods, and a reduced gradient method for jointly chance constrained problems. The first part of the book introduces the algorithms, including a unified approach to decomposition methods and their regularized counterparts. The second part addresses computer implementation of the methods, describes a testing environment based on a model management system, and presents comparative computational results with the various algorithms. Emphasis is on the computational behavior of the algorithms.

Stochastic programming is the study of procedures for decision making under the presence of uncertainties and risks. Stochastic programming approaches have been successfully used in a number of areas such as energy and production planning, telecommunications, and transportation. Recently, the practical experience gained in stochastic programming has been expanded to a much larger spectrum of applications including financial modeling, risk management, and probabilistic risk analysis. Major topics in this volume include: (1) advances in theory and implementation of stochastic programming algorithms; (2) sensitivity analysis of stochastic systems; (3) stochastic programming applications and other related topics. Audience: Researchers and academies working in optimization, computer modeling, operations research and financial engineering. The book is appropriate as supplementary reading in courses on optimization and financial engineering.

This book provides an essential introduction to Stochastic Programming, especially intended for graduate students. The book begins by exploring a linear programming problem with random parameters, representing a decision problem under uncertainty. Several models for this problem are presented, including the main ones used in Stochastic Programming: recourse models and chance constraint models. The book not only discusses the theoretical properties of these models and algorithms for solving them, but also explains the intrinsic differences between the models. In the book’s closing section, several case studies are presented, helping students apply the theory covered to practical problems. The book is based on lecture notes developed for an Econometrics and Operations Research course for master students at the University of Groningen, the Netherlands - the longest-standing Stochastic Programming course worldwide.

Consisting of two parts, this book presents papers describing publicly available stochastic programming systems that are operational. It presents a diverse collection of application papers in areas such as production, supply chain and scheduling, gaming, environmental and pollution control, financial modeling, telecommunications, and electricity.

This volume in the SpringerBriefs in Energy series offers a systematic review of unit commitment (UC) problems in electrical power generation. It updates texts written in the late 1990s and early 2000s by including the fundamentals of both UC and state-of-the-art modeling as well as solution algorithms and highlighting stochastic models and mixed-integer programming techniques. The UC problems are mostly formulated as mixed-integer linear programs, although there are many variants. A number of algorithms have been developed for, or applied to, UC problems, including dynamic programming, Lagrangian relaxation, general mixed-integer programming algorithms, and Benders decomposition. In addition the book discusses the recent trends in solving UC problems, especially stochastic programming models, and advanced techniques to handle large numbers of integer- decision variables due to scenario propagation

A computationally oriented comparison of solution algorithms for two stage and jointly chance constrained stochastic linear programming problems, this is the first book to present comparative computational results with several major stochastic programming solution approaches. The following methods are considered: regularized decomposition, stochastic decomposition and successive discrete approximation methods for two stage problems; cutting plane methods, and a reduced gradient method for jointly chance constrained problems. The first part of the book introduces the algorithms, including a unified approach to decomposition methods and their regularized counterparts. The second part addresses computer implementation of the methods, describes a testing environment based on a model management system, and presents comparative computational results with the various algorithms. Emphasis is on the computational behavior of the algorithms.