Course Information
SemesterCourse Unit CodeCourse Unit TitleT+P+LCreditNumber of ECTS CreditsLast Updated Date
5ENM301Operation Research II3+0+03430.10.2026
Course Details
Language of Instruction Turkish
Level of Course Unit Bachelor's Degree
Department / Program Industrial Engineering
Type of Program Formal Education
Type of Course Unit Compulsory
Course Delivery Method Face To Face
Objectives of the Course The objective of this course is to introduce methods and techniques for solving mathematical models that facilitate optimal decision-making, while exploring their real-world applications. It covers fundamental approaches to solving linear programming problems and provides a detailed examination of methods for addressing transportation problems. Through illustrative examples of assignment problems—and a significant focus on network analysis—students will gain the practical skills necessary to apply these techniques. Each session will conclude with applied examples to reinforce the concepts presented. Ultimately, the course aims to establish a solid theoretical foundation at the undergraduate level, equipping graduates with the knowledge and skills to model and analyze problems they may encounter in the public or private sectors, as well as the ability to interpret the results of such analyses.
Course Content CHAPTER 1: Network models
CHAPTER 2: Shortest path problem
CHAPTER 3: Minimum Spanning Tree Problem
CHAPTER 4: Maximum Flow Problem
CHAPTER 5: Integer Programming
CHAPTER 6: Branch-and-Bound Algorithm
CHAPTER 7: Cutting-Plane Algorithm
Course Methods and Techniques inside
Prerequisites and co-requisities None
Course Coordinator None
Name of Lecturers Asist Prof.Dr. Metehan ATAY
Assistants None
Work Placement(s) No

Recommended or Required Reading
Resources Operations Research: An Introduction, Hamdy Taha, Ninth Ed., Pearson, 2011. 2- Introduction to Operations Research, Frederich S. Hillier, Gerald J. Lieberman, Ninth Ed. McGraw-Hill, 2010
Course Notes Operations Research: An Introduction, Hamdy Taha, Ninth Ed., Pearson, 2011.
2- Introduction to Operations Research, Frederich S. Hillier, Gerald J. Lieberman, Ninth Ed. McGraw-Hill, 2010
Documents .
Assignments .
Exams .

Course Category
Field %100

Planned Learning Activities and Teaching Methods
Activities are given in detail in the section of "Assessment Methods and Criteria" and "Workload Calculation"

Assessment Methods and Criteria
In-Term Studies Quantity Percentage
Mid-terms 1 % 40
Final examination 1 % 60
Total
2
% 100

 
ECTS Allocated Based on Student Workload
Activities Quantity Duration Total Work Load
Course Duration 15 4 60
Hours for off-the-c.r.stud 15 4 60
Presentation 12 2 24
Mid-terms 1 3 3
Final examination 1 3 3
Total Work Load   Number of ECTS Credits 5 150

 
Course Learning Outcomes: Upon the successful completion of this course, students will be able to:
Bilgi 
3 Operations Research: An Introduction, Hamdy Taha, Ninth Ed., Pearson, 2011. 2- Introduction to Operations Research, Frederich S. Hillier, Gerald J. Lieberman, Ninth Ed. McGraw-Hill, 2010
Beceri 
2 Operations Research: An Introduction, Hamdy Taha, Ninth Ed., Pearson, 2011. 2- Introduction to Operations Research, Frederich S. Hillier, Gerald J. Lieberman, Ninth Ed. McGraw-Hill, 2010
4 Operations Research: An Introduction, Hamdy Taha, Ninth Ed., Pearson, 2011. 2- Introduction to Operations Research, Frederich S. Hillier, Gerald J. Lieberman, Ninth Ed. McGraw-Hill, 2010
Yetkinlik 
1 Operations Research: An Introduction, Hamdy Taha, Ninth Ed., Pearson, 2011. 2- Introduction to Operations Research, Frederich S. Hillier, Gerald J. Lieberman, Ninth Ed. McGraw-Hill, 2010
5 Operations Research: An Introduction, Hamdy Taha, Ninth Ed., Pearson, 2011. 2- Introduction to Operations Research, Frederich S. Hillier, Gerald J. Lieberman, Ninth Ed. McGraw-Hill, 2010

 
Weekly Detailed Course Contents
WeekTopicsStudy MaterialsMaterials
1 Ulaştırma Modelleri
2 Atama Modelleri
3 Ağ modellerine Giriş ve Ağ Analizi
4 Hesaplamalı Karmaşıklık Teorisi
5 En kısa Yol Problemi – Floyd Warshall Algoritması
6 Dijkstra Algoritması – Bellman Ford Algoritması
7 Minimum Yayılan Ağaç Problemi
8 ARA SINAV HAFTASI
9 Kruskal ve Prim Algoritması
10 Maksimum Akış Problemi – Ford Fulkerson Algoritması
11 Edmonds Karp Algoritması
12 Dal-Sınır Algoritması
13 Kesme Düzlemi Algoritması
14 Doğrusal Olmayan Programlamaya Giriş
15 Altın kesit arama yöntemi

 
Contribution of Learning Outcomes to Programme Outcomes
P1 P2 P3 P4 P5 P6 P7 P8 P9 P10 P11 P12 P13 P14 P15 P16 P17 P18 P19 P20 P21 P22 P23 P24
All 4 4 4 3 3 3 3 3
In3 4 3 4 3 4 3 4 3
Sk2 4 4 4 3 3 3 3 4
Sk4 3 4 4 3 3 3 3 3
Co1 4 4 4 4 4 3 3 3
Co5 3 3 3 3 3 3 4 4

  Contribution: 1: Very Slight 2:Slight 3:Moderate 4:Significant 5:Very Significant