|
|
| IST7023 | Multi Criteria Decision Making | 3+0+0 | ECTS:7.5 | | Year / Semester | Spring Semester | | Level of Course | Third Cycle | | Status | Elective | | Department | DEPARTMENT of STATISTICS and COMPUTER SCIENCES | | Prerequisites and co-requisites | None | | Mode of Delivery | Face to face | | Contact Hours | 14 weeks - 3 hours of lectures per week | | Lecturer | -- | | Co-Lecturer | None | | Language of instruction | Turkish | | Professional practise ( internship ) | None | | | | The aim of the course: | | Explaining the methods for solving Multiple Criteria Decision Making Problems, applications in practice. |
| Programme Outcomes | CTPO | TOA | | Upon successful completion of the course, the students will be able to : | | | | PO - 1 : | form the mathematical model of an multi-criteria problem. | 1,2,4,5,6,7 | 1,3,5 | | PO - 2 : | solve the multi-criteria problem by using the technics that given in course. | 1,2,4,5,6 | 1,3,5 | | PO - 3 : | by modeling the multi-criteria and limited problems in other disciplines reach a solution. | 1,2,4,5,6 | 1,3,5 | | PO - 4 : | solve the multi-criteria problems that they modelled mathematically using the package program. | 1,2,4,5,6 | 1,3,5 | | PO - 5 : | bring economic comments to solving the multi-criteria problems | 1,2,4,5,6 | 1,3,5 | | 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), PO : Learning Outcome | | |
| Models and principles of modeling in operational research method, multi criteria simplex method, network analysis, queuing and inventory models, goal programing, dynamic and non-dynamic programming, decision analysis. |
| |
| Course Syllabus | | Week | Subject | Related Notes / Files | | Week 1 | Basic concepts of multi criteria decision making. | | | Week 2 | Mathematical structure of multi criteria decision models. | | | Week 3 | Multi-purpose simplex method (Zeleyn Algorithm). | | | Week 4 | The basic concepts of game theory. | | | Week 5 | Superior options principle. | | | Week 6 | Absolute criteria method. | | | Week 7 | Interactive methods: Stem methods | | | Week 8 | Mid-term exam | | | Week 9 | Interactive methods: Belenson-Kapor method.
| | | Week 10 | Interactive methods: Zionts-Wallerius method. | | | Week 11 | Mediation programming. | | | Week 12 | Goal programming. | | | Week 13 | Queuing and inventory models. | | | Week 14 | Dynamic programming. | | | Week 15 | Non-dynamic programming | | | Week 16 | End-of-term exam | | | |
| 1 | Hamdy A. TAHA, 2000; Yöneylem Araştırması, Literatür Yayınları, İstanbul. | | | |
| 1 | Charnes, A., 1991;Management Models and Industrial Applications of Linear Programming, John Wiley and Sons, London. | | | |
| Method of Assessment | | Type of assessment | Week No | Date | Duration (hours) | Weight (%) | | Mid-term exam | 9 | 22/11/2013 | 2 | 50 | | End-of-term exam | 16 | 10/01/2014 | 2 | 50 | | |
| Student Work Load and its Distribution | | Type of work | Duration (hours pw) | No of weeks / Number of activity | Hours in total per term | | Sınıf dışı çalışma | 5 | 14 | 70 | | Ödev | 4 | 14 | 56 | | Total work load | | | 126 |
|