|
|
| EKO3007 | Operations Research - I | 3+0+0 | ECTS:6 | | Year / Semester | Fall Semester | | Level of Course | First Cycle | | Status | Compulsory | | Department | DEPARTMENT of ECONOMETRICS | | Prerequisites and co-requisites | None | | Mode of Delivery | | | Contact Hours | 14 weeks - 3 hours of lectures per week | | Lecturer | Prof. Dr. Tuba YAKICI AYAN | | Co-Lecturer | None | | Language of instruction | Turkish | | Professional practise ( internship ) | None | | | | The aim of the course: | | The course aims to provide the students with the skills to plan and model complex systems, and rational and optimal solution methods. Because of learning, the student will understand the underlying algorithms and be able to interpret the results. He/She will be able to formulate problems as abstract models, which can be solved by generic algorithms. |
| Learning Outcomes | CTPO | TOA | | Upon successful completion of the course, the students will be able to : | | | | LO - 1 : | learn the basic concepts of operations research. | 1 - 2 | 1, | | LO - 2 : | able to model real life problems. | 1 - 2 | 1, | | LO - 3 : | able to apply various operations research techniques. | 1 - 2 | 1, | | LO - 4 : | able to interpret in detail the findings obtained with operations research techniques. | 1 - 2 | 1, | | CTPO : Contribution to programme outcomes, TOA :Type of assessment (1: written exam, 2: Oral exam, 3: Homework assignment, 4: Laboratory exercise/exam, 5: Seminar / presentation, 6: Term paper), LO : Learning Outcome | | |
| Model Building, Linear programming, Graphical solution method, Simplex solution method, Special cases in linear programming (no solution, infinite solution, optimal solution with options, free signed variable case), Dual Simplex method, Two-stage simplex method, Duality theory, Primal-dual relationship, complementary slack theorem, Sensitivity analysis. |
| |
| Course Syllabus | | Week | Subject | Related Notes / Files | | Week 1 | Modelling a linear programming problem | | | Week 2 | Modelling a linear programming problem | | | Week 3 | Modelling a linear programming problem | | | Week 4 | Graphical solution method | | | Week 5 | Graphical solution method | | | Week 6 | Simplex method | | | Week 7 | Simplex method | | | Week 8 | Simplex method | | | Week 9 | Mid-term exam | | | Week 10 | Unsolvability in linear programming
Infinite solution in linear programming | | | Week 11 | Alternative optimal solutions in linear programming
Free signed variables in linear programming | | | Week 12 | Dual Simplex method
Two phase method | | | Week 13 | Primal-dual relationship
Complementary slack method
Sensivity analysis | | | Week 14 | Sensivity analysis | | | Week 15 | Sensivity analysis | | | Week 16 | End-of-term exam | | | |
| 1 | Yakıcı Ayan, Tuba, 2020, Yöneylem Araştırması-I ; Yayınlanmamış ders notları | | | |
| 1 | Baray Alp, Esnaf Şakir; 2017, Yöneylem Araştırması, Literatür Yayıncılık, (Çeviri: Taha A. , Hamdi, Operations Research an in Introduction, 6 th edition) | | | |
| Method of Assessment | | Type of assessment | Week No | Date | Duration (hours) | Weight (%) | | Mid-term exam | 9 | /11/2024 | 1 | 50 | | End-of-term exam | 16 | /01/2025 | 1 | 50 | | |
| Student Work Load and its Distribution | | Type of work | Duration (hours pw) | No of weeks / Number of activity | Hours in total per term | | Yüz yüze eğitim | 3 | 14 | 42 | | Sınıf dışı çalışma | 6 | 14 | 84 | | Arasınav için hazırlık | 11 | 2 | 22 | | Arasınav | 1 | 1 | 1 | | Dönem sonu sınavı için hazırlık | 10 | 3 | 30 | | Dönem sonu sınavı | 1 | 1 | 1 | | Total work load | | | 180 |
|