| Course Unit Title | Course Unit Code | Type of Course Unit | Level of Course Unit | Year of Study | Semester | ECTS Credits |
|---|---|---|---|---|---|---|
| Dynamic Programming | MEN310 | Elective | Bachelor's degree | 3 | Spring | 5 |
Name of Lecturer(s)
Prof. Dr. Zerrin ALADAĞ
Assistant Prof. Dr. Atakan ALKAN
Assistant Prof. Dr. Yıldız ŞAHİN
Learning Outcomes of the Course Unit
1) Using the basic principles of dynamic programming approach.
2) Stating solution method for Integer Dynamic Programming.
3) Using solution method for Resource Allocation Problem.
4) Applying solution method to Inventory Problem.
5) Using solution method for Equipment Renewal Problem.
6) Comprehending solution method for Shortest Path Problem.
Program Competencies-Learning Outcomes Relation
| Program Competencies | ||||||||||||
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | ||
| Learning Outcomes | ||||||||||||
| 1 | High | High | High | No relation | Middle | No relation | No relation | No relation | High | High | Low | |
| 2 | High | High | High | No relation | Middle | No relation | No relation | No relation | High | High | Low | |
| 3 | High | High | High | No relation | Middle | No relation | No relation | No relation | No relation | High | Low | |
| 4 | High | High | High | No relation | Middle | No relation | No relation | No relation | No relation | High | Low | |
| 5 | High | High | High | No relation | Middle | No relation | No relation | No relation | No relation | High | Low | |
| 6 | High | High | High | No relation | Middle | No relation | No relation | No relation | No relation | No relation | Low | |
Mode of Delivery
Face to Face
Prerequisites and Co-Requisites
None
Recommended Optional Programme Components
Operations Research 1, Operations Research 2
Course Contents
This course covers;the basic principles of dynamic programming, parametric analysis, dynamic programming approach for continuous variables, Integer dynamic programming, resource allocation problem, inventory problem, equipment renewal problem and the shortest path problem.
Weekly Schedule
1) The basic principles of dynamic programming2) Parametric Analysis
3) Dynamic Programming Approach for Continuous Variables
4) Dynamic Programming Approach for Continuous Variables
5) Integer Dynamic Programming
6) Integer Dynamic Programming
7) Resource Allocation Problem
8) Midterm examination/Assessment
9) Resource Allocation Problem
10) Inventory Problem
11) Inventory Problem
12) Equipment Renewal Problem
13) Equipment Renewal Problem
14) The Shortest Path Problem
15) The Shortest Path Problem
16) Final examination
Recommended or Required Reading
Planned Learning Activities and Teaching Methods
Assessment Methods and Criteria
Contribution of Midterm Examination to Course Grade |
40% |
|---|---|
Contribution of Final Examination to Course Grade |
60% |
Total |
100% |
Language of Instruction
Turkish
Work Placement(s)
Not Required