NEU Logo
Đại học Kinh tế Quốc dânChương trình đào tạo
English
Tiếng Việt
NEU Logo
QR Code

Đại học Kinh tế Quốc dân

207 Giải Phóng,Bạch mai, Hà Nội, Việt Nam

(84)24.36.280.280

(84)24.38.695.992

facebook.com/ktqdNEU

QR Code
Bản quyền thuộc về: Đại học Kinh tế Quốc dân
Trang chủ
Hướng dẫn sử dụng
EP30.FSF1102 — Optimal Control Theory | Chương trình đào tạo NEU

EP30.FSF1102 — Optimal Control Theory

Credits
3
Self-study hours
90
Showing intake
K68-2026

Course description

This course introduces dynamic optimization with applications in economics and quantitative modeling. The course has two parts:

  • Discrete Dynamic Programming using value functions, Bellman equations, backward induction, and infinite-horizon discounted optimization.
  • Optimal Control Theory including calculus of variations, Euler–Lagrange equations, Pontryagin Maximum Principle (PMP), and the Hamilton–Jacobi–Bellman (HJB) framework.

Main topics include:

  • Finite-horizon dynamic programming
  • Infinite-horizon discounted dynamic programming
  • Contraction mapping and existence of solutions
  • Economic applications of DP
  • Calculus of variations
  • Euler–Lagrange equations
  • Pontryagin Maximum Principle
  • HJB equation
  • Continuous-time economic models

Course requirements

Requirements for taking final /terminal exams

Students are allowed to take the final exam if their attendance score reaches 5 points or more (on the scale of 10).

Requirements for attending classes

Students are responsible for attending all classes. In case of absence from school due to force majeure reasons, sufficient and reasonable proofs must be provided. For each absence, 1 point will be deducted 1 point. Students who miss any classes more than 3 times, with or without reason, will be considered as failing to complete the course and have to re-register.

Students will be awarded points for constructive comments, these points are added to attendance points and group assignments.

Groups who do not submit the group work will receive a score of 0 (zero). Late submissions will be deducted for each day of late submission.

Requirements for in-class behaviour

The course is conducted on the principle of respecting learners and lecturers. Any behaviour that affects the teaching and learning process is strictly prohibited.

Students must come to class on time. Students who are late more than 10 minutes after class starts will not be allowed to attend the class. Do not make noise and affect others during the learning process.

Laptops and tablets are only used for the purpose of taking notes for and calculating for lectures and exercises, absolutely forbidden to use for other purposes.

Detailed content

The course content is organized into six chapters:

Chapter 1. Introduction to Dynamic Optimization

Chapter 2. Finite Horizon Problems 

Chapter 3. Infinite Horizon Problem

Chapter 4. Introduction to optimal control

Chapter 5. Calculus of Variations 

Chapter 6. Optimal Control

Lecturers

  • Nguyen Van Quy
  • Vuong Van Yen
  • Duong Viet Thong

Teaching plan

Week 1

Chapter 1. Introduction to Dynamic Optimization Remind Calculus and Optimization Dynamic optimization concepts States, controls, transitions Examples: shortest path, optimal growth,
References
Syllabus, [1] Chapter 1
Activities
Lectures: Introduce syllabus, textbooks, references, and course expectations Lecture: dynamic optimization concepts, state–control systems, examples (slides). Explain required mathematical background and prior knowledge. In-class discussions: students are encouraged to raise questions about the subject, what and how they would like to learn.
Assessment
Criteria: Attendance, Responding & Behavior Tools: Appendix 2, Rubric 1 Method: Attendance Check & Work Assignment

Week 3

Chapter 2. Finite Horizon Problems 2.1. Finite Horizon Problems 2.1.1 Finite-horizon problem formulation 2.1.2 Dynamic Programming Principle 2.2. Backward Induction & Bellman Equations 2.2.1 Backward induction algorithm 2.2.2 Bellman equations for finite horizon 2.2.3 Optimal policies 2.3. Optimal Policies in Finite Horizon 2.3.1 Solving Bellman static problems 2.3.2 Characterization of policies 2.3.3 Application: finite-horizon growth
References
[1] Chapter 2
Activities
Lectures: knowledge of finite horizon: dynamic Programming is discussed using slides, provide Homework 1. In-class discussions: students are encouraged to raise questions, participate in discussions, and share ideas with their peers. These discussions help students formulate their own opinions on controversial issues. In-class exercises: basic concepts and techniques are illustrated using examples. To follow the lectures closely, students are encouraged to work along with the instructor on these exercises.

Learning resources

  • Dynamic Optimisation for Economists. TSE lecture note — Blanchet, A., 2025
  • Calculus of Variations and Optimal Control Theory: A Concise Introduction — Liberzon, D., 2012
  • Optimal Control — Draguna Vrabie, Frank L. Lewis, and Vassilis L. Syrmos, 2012
  • Optimal Control Theory: Applications to Management Science and Economics — Suresh P. Sethi, 2020
  • Lecture notes and slides
Assessment
Criteria: Attendance, Responding & Behavior Tools: Appendix 2, Rubric 1 Method: Attendance Check

Week 5

Chapter 3. Infinite Horizon Problem 3.1. Mathematical Foundations 3.1.1 Banach spaces. 3.1.2 Contraction Mapping Theorem 3.1.3 Bellman operator 3.2. Infinite Horizon Dynamic Programming 3.2.1 Infinite-horizon optimization 3.2.2 Value fucntion iterarion 3.2.3 Existence and Uniqueness 3.2.4 Optimal stationary policies 3.3. Applications in Economics 3.3.1 Optimal growth model 3.3.2 Resource extraction 3.3.3 Dynamic asset choice
References
[1] Chapter 3
Activities
Lectures: knowledge of infinite horizon problem is discussed using slides, correct Homeowork 1 and provide Homework 2 In-class exercises: basic concepts and techniques are illustrated using examples. To follow the lectures closely, students are encouraged to work along with the instructor on these exercises, solve Homework 1 exercises. In-class discussions: students are encouraged to raise questions, participate in discussions, and share ideas with their peers. These discussions help students formulate their own opinions on controversial issues.
Assessment
Criteria: Attendance, Responding & Behavior Tools: Appendix 2, Rubric 1 Method: Attendance Check & Work Assignment

Week 7

Review Midterm 1
Assessment
Criteria: Calculation problems, Discussion questions Tools: Appendix 2, Rubric 2 Method: Written Exam

Week 8

Chapter 4. Introduction to optimal control 4.1 Preview of Infinite-dimensional optimization 4.1.1 Function spaces, norms, and local minima 4.1.2 First variation and first-order necessary condition 4.1.3 Second variation and second-order conditions 4.1..4 Global minima and convex problems 4.2 Optimal control problems
References
[2] Chapter 1
Activities
Lectures: basic knowledge of Infinite-dimensional optimization and optimal control is discussed using slides, correct Homeowork 3 and provide Homework 4 In-class exercises: basic concepts and techniques are illustrated using examples. To follow the lectures closely, students are encouraged to work along with the instructor on these exercises, solve Homework 3 exercises. In-class discussions: students are encouraged to raise questions, participate in discussions, and share ideas with their peers. These discussions help students formulate their own opinions on controversial issues.
Assessment
Criteria: Attendance, Responding & Behavior Tools: Appendix 2, Rubric 1 Method: Attendance Check & Work Assignment

Week 10

Chapter 5. Calculus of Variations 5.1. Variational problems 5.1.1 Examples of variational problems 5.1.2 Basic calculus of variations problem 5.2. First-order necessary conditions for weak extrema 5.2.1 Euler-Lagrange equation 5.2.2 Hamilton’s canonical equations 5.2.3 Legendre transformation 5.2.4 Variational problems with constraints 5.3. Second-order conditions 5.3.1 Legendre’s necessary condition for a weak minimum 5.3.2 Sufficient condition for a weak minimum
References
[2] Chapter 2
Activities
Lectures: knowledge of calculus of variations is discussed using slides, correct Homework 4 and provide Homework 5 In-class exercises: basic concepts and techniques are illustrated using examples. To follow the lectures closely, students are encouraged to work along with the instructor on these exercises, solve Homework 4 exercises. In-class discussions: students are encouraged to raise questions, participate in discussions, and share ideas with their peers. These discussions help students formulate their own opinions on controversial issues.
Assessment
Criteria: Attendance, Responding & Behavior Tools: Appendix 2, Rubric 1 Method: Attendance Check & Work Assignment

Week 12

Chapter 6. Optimal Control 6.1. From Calculus of Variations to Optimal Control 6.1.1 Calculus of variations versus optimal control 6.1.2 ptimal control problem formulation and assumptions 6.1.3 Variational approach to the fixed-time, free-endpoint problem 6.2. The Maximum Principle 6.2.1 Statement and proof of the maximum principle 6.2.2 Discussion of the maximum principle 6.2.3 Existence of optimal controls 6.3. The Hamilton-Jacobi-Bellman Equation 6.3.1 Dynamic programming and the HJB equation 6.3.2 HJB equation versus the maximum principle 6.3.3 Viscosity solutions of the HJB equation
References
[2] Chapter 3-5
Activities
Lectures: knowledge of solving optimal control problem is discussed using slides, correct Homework 5 and provide Homework 6 In-class exercises: basic concepts and techniques are illustrated using examples. To follow the lectures closely, students are encouraged to work along with the instructor on these exercises, solve Homework 5 exercises. In-class discussions: students are encouraged to raise questions, participate in discussions, and share ideas with their peers. These discussions help students formulate their own opinions on controversial issues.
Assessment
Criteria: Attendance, Responding & Behavior Tools: Appendix 2, Rubric 1 Method: Attendance Check & Work Assignment

Week 15

Midterm 2 and Review
Activities
Homework 6 discussion (TU) Revision (TU) Midterm 2
Assessment
Criteria: Calculation problems, Discussion questions Tools: Appendix 2, Rubric 2 Method: Written Exam
Final exam
Activities
Students take exams according to give schedule
Assessment
According to the exam requirement Appendix 2, Rubric 2