Optimal Control Models & Applications
16:711:613, Index # 06641, 3 credits
Fall 1996

General information

This is a reading course, intended for self-study and independent research.

Syllabus

  1. Review of Dynamic Programming (DP), Bellman's Optimality Principle and recursive computation.
  2. Selected applications of DP: Equipment replacement. Resource allocation. Shortest path problems.
  3. Discrete time optimal control problems. Problems with linear dynamics and quadratic criteria.
  4. Review of stochastic DP.
  5. Calculus of variations. The Euler-Lagrange necessary conditions. ``Derivation'' using DP. The Legendre, Weiestrass and Erdmann conditions. The Hamilton-Jacobi-Bellman equation.
  6. Optimal control. The Pontryagin Maximum Principle. ``Derivation'' using DP. The Hamilton-Jacobi-Bellman equation. The adjoint. Economic interpretations.
  7. Applications to economic models of optimal growth: The Ramsey model. The turnpike theorem.
  8. Applications to finance: The cash balance problem, with overdraft and short-selling. An optimal financing model.
  9. Applications to production and inventory.
  10. Applications to marketing: The Nerlove-Arrow and Vidal-Wolfe advertising models.
  11. Applications to non-renewable natural resources. The Hotteling optimal extraction rate.
  12. Applications to renewable natural resources. Fishery and forestry models, optimal harvesting.
  13. Applications to maintenance and replacement.

Course Work

Each student is required to write LaTeX notes of one or more topics, to present a lecture on one of the topics 7-13 above, and to write a paper on some aspect or application of DP/Optimal Control.

References