Course Detail

Dynamic Programming/Markov Decision Processes (36902)

Course Description by Faculty

  • Caldentey, Rene
  • Content
    Decisions are often made sequentially and in environments where their outcomes are subject to stochastic variability. Dynamic Programming (DP) provides a powerful tool for obtaining structural insight about, as well computing prescriptions for, such decisions. The method finds wide application in operations management, marketing, economics, and finance among other fields. This course is intended to provide a rigorous introduction to the method with an emphasis on applications from these fields. When appropriate, finite or countable state Markovian settings will be used to obtain theoretical results with a minimum of technical fuss. Implementation and computational issues will be discussed.
  • Prerequisites
    Linear and/or nonlinear optimization, Markov chain theory. PhD students only.
    • PhD - students only

  • Materials
    The following textbook will be used extensively as the primary reading for the course: Dynamic Programming and Optimal Control, Vols. 1 (3rd Edition) and 2 (4th Edition) by Dimitri P. Bertsekas. In addition a few research papers will be distributed in class.
  • Grades
    No provisional grades.
  • Syllabus
  • Spring 2023Section: 36902-50M 8:30AM-11:30AMHarper Center3A - Seminar RoomIn-Person Only
Description and/or course criteria last updated: June 8 2022