Author Description

Carefully written to cover all necessary background material from both linear and non-linear programming as well as probability theory, the book brings together the methods and techniques previously described in disparate sources. Topics include decision trees and dynamic programming, recourse problems, probabilistic constraints, preprocessing and network problems. Emphasises the appropriate use of the techniques described. Exercises are provided at the end of each chapter.