1 |
Course Title: |
OPERATIONS RESEARCH I |
2 |
Course Code: |
END3033 |
3 |
Type of Course: |
Compulsory |
4 |
Level of Course: |
First Cycle |
5 |
Year of Study: |
3 |
6 |
Semester: |
5 |
7 |
ECTS Credits Allocated: |
5 |
8 |
Theoretical (hour/week): |
3 |
9 |
Practice (hour/week) : |
0 |
10 |
Laboratory (hour/week) : |
1 |
11 |
Prerequisites: |
Introduction to Mathematical Programming |
12 |
Recommended optional programme components: |
None |
13 |
Language: |
English |
14 |
Mode of Delivery: |
Face to face |
15 |
Course Coordinator: |
Doç. Dr. Fatih ÇAVDUR |
16 |
Course Lecturers: |
|
17 |
Contactinformation of the Course Coordinator: |
e-posta: fatihcavdur@uludag.edu.tr, Telefon: + 90 (224) 294 20 77 Adress: Uludağ Üniversitesi, Mühendislik-Mimarlık Fakültesi, Endüstri Mühendisliği Bölümü, Görükle Kampüsü, 16059 Nilüfer, Bursa |
18 |
Website: |
|
19 |
Objective of the Course: |
Learning operations research techniques, and finding the best solution using the building-up analytical thinking approach.
|
20 |
Contribution of the Course to Professional Development |
|
Week |
Theoretical |
Practical |
1 |
Introduction
Solution of Linear Programming Problems: Simplex Method
-Standard and canonical forms
-Introduction to simplex algorithm
|
Using LINDO for modeling linear programming problems. |
2 |
Solving linear programming problems using simplex algorithm. |
Using LINDO for the solution of linear programming problems, and interpreting results. |
3 |
Artifical Starting Solution (Big M Method)
Yapay Başlangıç Yöntemi
(Büyük M Yöntemi)
|
Solving MS Excel Solver for modeling and solving linear programming problems, interpreting results. |
4 |
Two-Phase Simplex Method |
Solving various linear programming problems and interpreting results. |
5 |
Special Cases of Simplex Algorithm
-Degeneracy
-Infeasibility
-Unbounded Solution
Simplex algorithm for unbounded variables
|
Analyzing special cases of simplex algorithms with examples. |
6 |
Sensitivity Analysis |
Sensitivity analysis practices. |
7 |
Sensitivity Analysis
-Objective function coefficient changes
-Right hand side changes
|
Sensitivity analysis practices. |
8 |
Sensitivity Analysis
-Objective function coefficient changes
-Right hand side changes
|
Sensitivity analysis practices. |
9 |
Duality
Primal / Dual Problems / Variables
Primal / Dual Transformation
Relations between the Primal / Dual Solutions |
Examples about primal/dual transformations / solutions. |
10 |
Dual simplex algorithm
Duality and Sensitivity analysis
Economic interpretation of the dual solutions-shadow prices-reduced costs
|
Economic interpretation of the dual solution |
11 |
Integer Programming
Analyzing various integer programming problems.
|
Modeling, solving and interpreting results of integer programming problems using MPL. |
12 |
Solving integer programming problems
-Branch and bound algorithm
-Cutting plane algorithm
|
Analyzing various integer programming problems. |
13 |
Goal Programming
Analyzing various goal programming problems
|
Modeling, solving and interpreting results of goal programming problems using MPL. |
14 |
Solving goal programming problems
-Preemptive goal programming
-Non-preemptive goal programming
|
Analyzing various goal programming problems. |