Information Package / Course Catalogue
Operation Research
Course Code: ULT301
Course Type: Required
Couse Group: First Cycle (Bachelor's Degree)
Education Language: Turkish
Work Placement: N/A
Theory: 3
Prt.: 0
Credit: 3
Lab: 0
ECTS: 6
Objectives of the Course

The primary objective of this course is to equip students with the ability to mathematically model and formulate real-world decision-making problems, and to generate numerical solutions for these models. To this end, the course aims to foster a deep understanding of the fundamental assumptions and concepts of Linear Programming. Students will learn various solution techniques, ranging from the graphical method to the Simplex algorithm, enabling them to address optimization problems at both theoretical and practical levels. Furthermore, by modeling and solving special problem types like transportation and assignment problems, and by conducting sensitivity analyses, students will gain the skill to interpret how obtained solutions behave in response to parameter changes. Finally, the course will provide students with practical skills to solve complex optimization problems in a computer environment, offering an opportunity to apply theoretical knowledge to real-world scenarios.

Course Content

This course aims to equip students with the ability to mathematically model real-world optimization problems using linear programming, solve them with various methods, analyze the solutions, and implement these solutions in a computer environment.

Name of Lecturer(s)
Lec. Kamil BİRCAN
Learning Outcomes
1.State the mathematical model of the problem
2.Solve the mathematical problem with proper method
3.Solve the mathematical problems with computer
4.explain operational research.
5.explain and use linear programing.
Recommended or Required Reading
1.Winston, W. L., Operations Research: Applications and Algorithms, Thomson Learning, 2004.
Weekly Detailed Course Contents
Week 1 - Theoretical
Linear Function and Cartesian Coordinate System
Week 2 - Theoretical
Building a Model in Linear Programming
Week 3 - Theoretical
Solve with Linear Programming Models by Graphics Method
Week 4 - Theoretical
Special Cases of the Graphical Method for Linear Programming Models
Week 5 - Theoretical
Simplex Algorithm: Solution of Maximization Problems
Week 6 - Theoretical
Simplex Algorithm: Solution of Minimization Problems - Special Topics
Week 7 - Theoretical
Duality in Linear Programming
Week 8 - Theoretical
Relationships Between Primal and Dual Models
Week 9 - Theoretical
Relationships Between Primal and Dual Models
Week 10 - Theoretical
Sensitivity Analysis
Week 11 - Theoretical
Sensitivity Analysis
Week 12 - Theoretical
Sensitivity Analysis
Week 13 - Theoretical
Transportation Problems: Definition and Modeling with Linear Programming
Week 14 - Theoretical
Assignment Problems: Definition and Modeling with Linear Programming
Assessment Methods and Criteria
Type of AssessmentCountPercent
Midterm Examination1%40
Final Examination1%60
Workload Calculation
ActivitiesCountPreparationTimeTotal Work Load (hours)
Lecture - Theory130339
Individual Work130452
Midterm Examination127128
Final Examination131132
TOTAL WORKLOAD (hours)151
Contribution of Learning Outcomes to Programme Outcomes
PÇ-1
PÇ-2
PÇ-3
PÇ-4
PÇ-5
PÇ-6
PÇ-7
PÇ-8
PÇ-9
PÇ-10
PÇ-11
PÇ-12
PÇ-13
OÇ-1
4
5
5
5
4
5
3
2
4
3
4
3
OÇ-2
4
3
2
1
3
4
5
3
5
4
2
1
OÇ-3
4
3
2
1
4
4
4
2
2
3
3
3
OÇ-4
3
2
4
3
4
3
4
5
3
2
4
3
OÇ-5
4
3
3
4
2
4
2
4
3
5
3
2
Adnan Menderes University - Information Package / Course Catalogue
2026