Operations Research II
Industrial Engineering
Faculty of Engineering
First Cycle (Bachelor's Degree)
| Course Unit Title | Course Unit Code | Type of Course Unit | Level of Course Unit | Year of Study | Semester | ECTS Credits |
|---|---|---|---|---|---|---|
| Operations Research II | MEN308 | Compulsory | 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) The students would comprehend modelling and solving of goal programming.
2) The students would realize modelling and solving of integer programming.
3) The students would comprehend cutting plane techniques.
4) The students would comprehend branch and bound techniques.
5) The students would comprehend types of network problems.
6) The students would comprehend maximum flow problems.
7) The students would comprehend shortest path problems.
Program Competencies-Learning Outcomes Relation
| Program Competencies | ||||||||||||
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | ||
| Learning Outcomes | ||||||||||||
| 1 | No relation | High | High | No relation | No relation | Low | No relation | Low | High | High | Middle | |
| 2 | High | High | High | No relation | No relation | Low | No relation | Low | High | High | Middle | |
| 3 | High | High | High | No relation | No relation | Low | No relation | Low | High | High | Middle | |
| 4 | High | High | High | No relation | No relation | Low | No relation | Low | High | High | Middle | |
| 5 | High | High | High | No relation | No relation | Low | No relation | Low | High | High | Middle | |
| 6 | High | High | High | No relation | No relation | Low | No relation | Low | High | High | Middle | |
| 7 | High | High | High | No relation | No relation | Low | No relation | Low | High | High | Middle | |
Mode of Delivery
Face to Face
Prerequisites and Co-Requisites
None
Recommended Optional Programme Components
Operations Research I
Course Contents
Goal Programming,Integer programming(The branch-and-Bound method, the cutting plane method), network models
Weekly Schedule
1) Goal programming2) Goal programming
3) Integer programming
4) Cutting Plane
5) Cutting Plane
6) Branch and Bound Algorithm
7) Branch and Bound Algorithm
8) Midterm examination/Assessment
9) Types of Network Models
10) Types of Network Models
11) Maximum Flow Problem
12) Maksimum Flow Problemi
13) Shortest Path Problem
14) Shortest Path Problem
15) Shortest Path Problem
16) Final examination
Recommended or Required Reading
Planned Learning Activities and Teaching Methods
1) Lecture
2) Discussion
3) Drill and Practice
4) Problem Solving
5) Project Based Learning
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