|
|
| IST3000 | Operational Research | 4+0+0 | ECTS:5 | | Year / Semester | Spring Semester | | Level of Course | First Cycle | | Status | Compulsory | | Department | DEPARTMENT of STATISTICS and COMPUTER SCIENCES | | Prerequisites and co-requisites | None | | Mode of Delivery | Face to face | | Contact Hours | 14 weeks - 4 hours of lectures per week | | Lecturer | Prof. Dr. Türkan ERBAY DALKILIÇ | | Co-Lecturer | ASSOC. PROF. Orhan KESEMEN | | Language of instruction | Turkish | | Professional practise ( internship ) | None | | | | The aim of the course: | | To give the students the methods, techniques and materials to enable them to find the optimal solutions for the problems that are coming from a system, . |
| Learning Outcomes | CTPO | TOA | | Upon successful completion of the course, the students will be able to : | | | | LO - 1 : | determine the initial basic solutions for the transportation and appointment problems, and then get optimal solutions of these problems. | 2,9 | | | LO - 2 : | solve the network analysis problems | 2,9 | | | LO - 3 : | form the time table for the critical path | 2,9 | | | LO - 4 : | solve game problems with algebraic, graph and matrix methods. | 2,9 | | | 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 | | |
| Problem of transformation, assignment problems, network analysis, min. (max. ) algorithm, time tables, project management (PERT-CPM) , game theory, algebraically, graphical, matrix solutions. |
| |
| Course Syllabus | | Week | Subject | Related Notes / Files | | Week 1 | Basic Definitions and Concepts. | | | Week 2 | Definition of Transport Model. | | | Week 3 | Analyzing the Transportation Model. | | | Week 4 | Sensitivity Analysis of Transportation Problems. | | | Week 5 | Assignment Model and Solution Techniquesi | | | Week 6 | Network Analysis: Shortest Path, Minimum Propagation | | | Week 7 | Network Analysis:Largest Flow. | | | Week 8 | Project Management: Critical path method (CPM) | | | Week 9 | Mid-term exam
| | | Week 10 | Establishment of project timing table | | | Week 11 | Pert Analysis. | | | Week 12 | Decision Theory. | | | Week 13 | Game Theory: Two-person zero-sum games. | | | Week 14 | Goal Programming: Single-targeted programming, equally-weighted multi-targeted programming. | | | Week 15 | Goal Programming: Multi-targeted priority programming, weighted priority multi-targeted programming. | | | Week 16 | End-of-term exam | | | |
| 1 | Hamdy A. TAHA, 2000; Yöneylem Araştırması, Literatür Yayınları, İstanbul. | | | |
| 1 | Prof. Dr. Emin Zeki BAŞKENT, 2004; Yöneylem Araştırması, KTÜ Yayınları, Trabzon. | | | 2 | Prof. Dr. Ahmet ÖZTÜRK, 2004; Yöneylem Araştırması, Ekin Kitabevi, Bursa. | | | |
| Method of Assessment | | Type of assessment | Week No | Date | Duration (hours) | Weight (%) | | Mid-term exam | 9 | 24/11/2021 | 1 | 50 | | End-of-term exam | 16 | 14/01/2022 | 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 | 4 | 14 | 56 | | Sınıf dışı çalışma | 4 | 14 | 56 | | Arasınav için hazırlık | 15 | 1 | 15 | | Arasınav | 1.5 | 1 | 1.5 | | Dönem sonu sınavı için hazırlık | 25 | 1 | 25 | | Dönem sonu sınavı | 1.5 | 1 | 1.5 | | Total work load | | | 155 |
|