Static and Dynamic Optimization
Code 260PP
Credits 6
Learning outcomes
The course is concerned with the classical theory of static optimization (Kuhn-Tucker theorem, generalized convexity, envelope theorems) and dynamic optimization both in discrete (Bellman principle) and in continuous time (maximum principle).