| TYPE OF COURSE UNIT | Elective Course |
| LEVEL OF COURSE UNIT | Master's Degree Without Thesis |
| YEAR OF STUDY | - |
| SEMESTER | - |
| NUMBER OF ECTS CREDITS ALLOCATED | 10 |
| NAME OF LECTURER(S) | Associate Professor Barış Keçeci
|
| LEARNING OUTCOMES OF THE COURSE UNIT |
At the end of this course, the students;
1) will have an ability to design a system, component, or process to meet desired needs within realistic constraints.
2) will have an ability to use the techniques, skills, and modern engineering tools necessary for engineering practice.
3) will have an ability to solve linear decisions models.
|
| MODE OF DELIVERY | Face to face |
| PRE-REQUISITES OF THE COURSE | No |
| RECOMMENDED OPTIONAL PROGRAMME COMPONENT | None |
| COURSE DEFINITION | Origins of Operations Research. Systems approach, interdisciplinary research and the scientific method. Fundamentals and the theory of linear programming. The Simplex algorithm, big-M and two-phase Simplex method. Duality and sensitivity analysis. Transportation and assignment problems; shortest path, minimum spanning tree and minimum cost flow models. Integer programming. Dynamic programming. |
| COURSE CONTENTS | | WEEK | TOPICS |
|---|
| 1st Week | Methods of Operations Research | | 2nd Week | Examples for Linear Programming | | 3rd Week | The Generic Form of a Linear Program and Basic Definitions | | 4th Week | The Basics of Linear Programming and Solution Approaches | | 5th Week | Simplex Algorithm | | 6th Week | Variations of the Simplex algorithm | | 7th Week | Duality in Linear programming | | 8th Week | Midterm exam | | 9th Week | Sensitivity Analysis | | 10th Week | Transportation and Assignment Models | | 11th Week | Shortest path, maximal flows and minimal spanning tree problems | | 12th Week | Integer Programming | | 13th Week | Goal programming | | 14th Week | Computer applications |
|
| RECOMENDED OR REQUIRED READING | (1) Kara, İ. (2000) Doğrusal Programlama, Bilim Teknik Yayınevi.
(2) Winston, W.L. (1994) Operations Research: Applications and Algorithms, Duxbury Press.
|
| PLANNED LEARNING ACTIVITIES AND TEACHING METHODS | Lecture,Other |
| ASSESSMENT METHODS AND CRITERIA | | | Quantity | Percentage(%) |
|---|
| Mid-term | 1 | 35 | | Quiz | 3 | 20 | | Attendance | 1 | 5 | | Total(%) | | 60 | | Contribution of In-term Studies to Overall Grade(%) | | 60 | | Contribution of Final Examination to Overall Grade(%) | | 40 | | Total(%) | | 100 |
|
| ECTS WORKLOAD |
| Activities |
Number |
Hours |
Workload |
| Midterm exam | 1 | 2 | 2 | | Preparation for Quiz | 3 | 4 | 12 | | Individual or group work | 14 | 14 | 196 | | Preparation for Final exam | 1 | 20 | 20 | | Course hours | 14 | 3 | 42 | | Preparation for Midterm exam | 1 | 20 | 20 | | Laboratory (including preparation) | | | | | Final exam | 1 | 2 | 2 | | Homework | | | | | Total Workload | | | 294 |
|---|
| Total Workload / 30 | | | 9,8 |
|---|
| ECTS Credits of the Course | | | 10 |
|---|
|
| LANGUAGE OF INSTRUCTION | Turkish |
| WORK PLACEMENT(S) | No |
| | |
