Skip to: search, navigation, or content.


Indiana University Bloomington

Operations & Decision Technologies

1960 Notable

From 1960-2013, we prepared nearly 1,200 men and women
for rewarding academic careers — that’s more than any other university.

Doctoral Courses

  1. K605
    Dynamic Programming
    • 15-weeks
    • 1.5 credits
    • Prerequisite: None

    This course provides an introduction to the formulation and analysis of dynamic optimization problems. Topics include, convexity and concavity, K-convexity, stochastic dominance, dimensionality reduction in dynamic programs, and Lippman’s transformation.