This book investigates a unified framework for convex stochastic optimization (CSO) problems, drawing together diverse formulations from operations research, financial mathematics, and stochastic optimal control. The authors extend the established theories of dynamic programming and convex duality to provide a simplified and unified approach to various problem classes documented in existing literature. These extensions not only consolidate existing knowledge but also introduce significant generalizations to current problem formulations, highlighting the pivotal roles both dynamic programming and duality have played in advancing optimality conditions and numerical methodologies for CSO problems.

The book presents a rigorous mathematical treatment of convex stochastic optimization, likely appealing to advanced students and researchers in mathematics, operations research, and quantitative finance. Its focus on unifying existing theories and introducing generalizations suggests a text that will be valued for its theoretical contributions and potential to simplify complex problem-solving approaches. The detailed exploration of dynamic programming and duality indicates a comprehensive scope for those seeking to deepen their understanding of optimization techniques in discrete time.