Learning Outcomes |
PO |
MME |
The students who succeeded in this course: |
|
|
LO-1 |
Be able to build different models except LP models. |
PO-13 It helps the students model their decision-making problem about life using the linear programming techniques, solve the simplex and transportation problems and interpret the outcomes in terms of technical and economical
|
Examination Performance Project |
LO-2 |
Be able to assess different types of decision making methods more systematically. |
PO-13 It helps the students model their decision-making problem about life using the linear programming techniques, solve the simplex and transportation problems and interpret the outcomes in terms of technical and economical
|
Examination Performance Project |
LO-3 |
Be able to interpret the relationship between operations research and decision making problems from the real world. |
PO-13 It helps the students model their decision-making problem about life using the linear programming techniques, solve the simplex and transportation problems and interpret the outcomes in terms of technical and economical
|
Examination Performance Project |
LO-4 |
Be able to solve the multi-criteria decision making problems. |
PO-13 It helps the students model their decision-making problem about life using the linear programming techniques, solve the simplex and transportation problems and interpret the outcomes in terms of technical and economical
|
Examination Performance Project |
PO: Programme Outcomes MME:Method of measurement & Evaluation |
Course Contents |
In the context of this course linear programming (the Simplex method, duality and sensitivity analysis), network models, integer programming, goal programming, dynamic programming, analytical hierarchy process, game theory and data envelopment analysis will be discussed. |
Weekly Course Content |
Week |
Subject |
Learning Activities and Teaching Methods |
1 |
Introduction |
Lecturing |
2 |
Linear Programming (the Simplex method, duality and sensitivity analysis) |
Lecturing |
3 |
Linear Programming (the Simplex method, duality and sensitivity analysis) |
Lecturing and Problem solving method, Presentation of performance homework |
4 |
Network Models |
Lecturing |
5 |
Network Models |
Lecturing and Problem solving method, Presentation of performance homework |
6 |
Integer Programming |
Lecturing |
7 |
Integer Programming |
Lecturing and Problem solving method, Presentation of performance homework |
8 |
mid-term exam |
|
9 |
Integer Programming |
Problem solving method |
10 |
Goal Programming |
Lecturing |
11 |
Goal Programming |
Lecturing and Problem solving method, Presentation of performance homework |
12 |
Dynamic Programming |
Lecturing |
13 |
Analytical Hierarchy Process |
Lecturing |
14 |
Game Theory |
Lecturing |
15 |
Data Envelopment Analysis |
Lecturing, Presentation of performance homework |
16 |
final exam |
|
Recommend Course Book / Supplementary Book/Reading |
1 |
1. Taha, Hamdy A.; Yöneylem Araştırması, (Çeviri: Ş.A. Baray; Ş. Esnaf), 6. Baskı, Literatür Yayıncılık, İstanbul, 2000. (Temel Ders Kitabı). |
2 |
Hillier, F. S., G. J. Lieberman; Introduction to Operations Research, 7th Edition, McGraw Hill, New York, 2001. |
Required Course instruments and materials |
1. Taha, Hamdy A.; Yoneylem Arastirmasi, (Ceviri: S.A. Baray; S. Esnaf), 6. Baski, Literatur Yayincilik, Istanbul, 2000. (Main Text Book).
2. Ozturk, Ahmet; Yoneylem Arastirmasina Giris, 1. Baski, Ekin Yayinevi, Bursa, 2011.
3. Ozguven, Cemal; Dogrusal Programlama ve Uzantilari, 1. Baski, Detay Yayincilik, Ankara, 2003.
4. Sezen, Hayrettin Kemal; Yoneylem Arastirmasi, 2. Baski, Ekin Yayinevi, 2007.
5. Hillier, F. S., G. J. Lieberman; Introduction to Operations Research, 7th Edition, McGraw Hill, New York, 2001. |