Leading With Data· a Bicycle Guide

Partial book profile

Dynamic Programming (Dover Books on Computer Science)

This book provides a concise introduction to the core principles of dynamic programming—states, functional equations, and the principle of optimality—and demonstrates their application to solving a wide range of sequential decision problems in operations research, including shortest paths, resource allocation, and inventory control.

The full book profile is not available yet.

Get the book →

What it’s about

Dynamic Programming: Models and Applications by Eric V. Denardo offers a clear and methodical entry into one of the most powerful toolsets for solving complex planning problems. Starting with the simple, intuitive challenge of finding a shortest path, the book systematically builds your understanding of fundamental concepts like states, functional equations, and the principle of optimality. It then guides you through classic applications in resource allocation, production control, and inventory management, focusing not just on computational algorithms but on providing deep qualitative insights into the structure of optimal solutions. Whether you're a student needing a foundational text or a practitioner seeking to master a rigorous framework for decision-making under certainty and uncertainty, this book will equip you to transform complex, multi-stage challenges into solvable problems with elegant and provably optimal policies.

The through-line

Who it’s for
A student, analyst, or professional in fields like operations research, economics, engineering, or management science who is tasked with solving complex planning and decision-making problems that unfold over time.
The problem
The character needs to find provably optimal solutions to multi-stage problems like resource allocation, scheduling, and inventory control, but finds that traditional methods are inefficient, don't guarantee optimality, or become computationally intractable. They feel overwhelmed by the interconnectedness and complexity of sequential decisions, frustrated by the lack of a clear, systematic approach, and uncertain if their ad-hoc solutions are truly the best possible.
The plan
  1. Master the fundamentals of states, stages, functional equations, and the principle of optimality using the intuitive shortest-path problem.
  2. Apply these concepts to solve a range of classic deterministic models, including resource allocation, production control, and network flows.
  3. Extend the framework to handle uncertainty by learning to model and solve Markov Decision Processes.
  4. Gain deep structural insight by discovering how problem characteristics like cost function shape determine the elegant structure of optimal policies.
  5. Get an introduction to infinite-horizon models, policy iteration, and other advanced techniques that form the foundation of modern sequential decision theory.
The payoff
Confidently model and solve a wide range of sequential decision problems. · Derive functional equations and implement algorithms to find optimal policies. · Understand the deep structure of problems and explain not just *what* the optimal solution is, but *why* it is optimal.

See our guide

Related profiles we’ve built

Featured in these guides

Co-cited books