School of Engineering \ Industrial Engineering
Course Credit
ECTS Credit
Course Type
Instructional Language
Programs that can take the course
Endüstri Mühendisliği, Yapay Zeka Mühendisliği
Integer Programming Models and Solution Techniques (Branch and Bound, Cutting Planes, Heuristic Methods), Network Models: Transportation and Assignment Problems, Minimum Spanning Tree, Shortest Path Problem, Flow Problems and Network Simplex Method.
Textbook and / or References
1. W. Winston, “Operations Research, Applications and Algorithms”, 4th edition, Thomson, 2004 (Textbook).
2. R. Rardin, “Optimization in Operations Research”, Prentice Hall, 2000 (Reference Book).
1. Ability to formulate real-life problems as mixed integer programming models
2. Ability to solve mathematical programming formulations using commercial software
3. Have an understanding about the exact solution methods for mixed integer programming models such as branch and bound and cutting planes
4. Have an understanding of the difficulty of finding an optimal solution for real life problems
5. Appreciate the usage of heuristic solution methods along with their advantages and disadvantages
6. Have a basic understanding about Network Flow problems and their solution methods
7. Ability to express results written and orally
8. Ability to work with a partner
9. Ability to design and conduct experiments to analyze a problem setting under different parameter values, and interpret the outcomes to identify key drivers and relationships.
Week 1: Introduction to Integer Programming and Modeling
Week 2: Introduction to Integer Programming and Modeling
Week 3: Introduction to Integer Programming and Modeling
Week 4: Introduction to Integer Programming and Modeling
Week 5: Optimality and Relaxations
Week 6: Branch and Bound Algorithm
Week 7: Branch and Bound Algorithm
Week 8: Cutting Plane Algorithm
Week 9: Intuitions and Metaheuristics
Week 10: Intuitions and Metaheuristics
Week 11: Transport, Assignment, Transfer, Shortest Path and Maximum Flow Problems
Week 12: Transport, Assignment, Transfer, Shortest Path and Maximum Flow Problems
Tentative Assesment Methods
Midterm Exam 20 %
Project/Case Study 25 %
Quizzes 15 %
Lab Quiz 10 %
Final Exam 30 %
|
Program Outcome
*
|
| 1 |
2 |
3 |
4 |
5 |
6 |
7 |
8 |
9 |
10 |
11 |
12 |
13 |
|
Course Outcome
|
|---|
| 1 |
C
|
A, B, C
|
|
A
|
|
C
|
|
|
|
|
|
|
|
| 2 |
|
|
|
A, B
|
|
C
|
|
|
|
|
|
|
|
| 3 |
C, A
|
A, B, C
|
|
A
|
|
C
|
|
|
|
|
|
|
|
| 4 |
C
|
A
|
|
|
|
C
|
|
|
|
|
|
|
|
| 5 |
C
|
A, B, C
|
|
A
|
|
C
|
|
|
|
|
|
|
|
| 6 |
C
|
A, B, C
|
A, B
|
A
|
|
C
|
|
|
|
|
|
|
|
| 7 |
|
|
|
|
|
|
A, B, C
|
|
|
|
|
|
|
| 8 |
|
|
|
|
|
A
|
|
|
|
|
|
|
|
| 9 |
|
|
|
|
B
|
|
|
|
|
|
|
|
|