|
|
| END3010 | Operations Research - II | 3+0+0 | ECTS:5 | | Year / Semester | Spring Semester | | Level of Course | First Cycle | | Status | Compulsory | | Department | DEPARTMENT of INDUSTRIAL ENGINEERING | | Prerequisites and co-requisites | DC must have been achieved from END3011-Operation Research - I | | Mode of Delivery | | | Contact Hours | 14 weeks - 3 hours of lectures per week | | Lecturer | Doç. Dr. Gökhan ÖZÇELİK | | Co-Lecturer | NON | | Language of instruction | Turkish | | Professional practise ( internship ) | None | | | | The aim of the course: | | The aim of this course is to guide the students to formulate and solve the specific problems that are covered in the course content. |
| Learning Outcomes | CTPO | TOA | | Upon successful completion of the course, the students will be able to : | | | | LO - 1 : | Ability to define, formulate and solve engineering problems
| 5 | | | LO - 2 : | Ability to model integer programming problems, analyze and interpret the results | 2 | | | LO - 3 : | Ability to use appropriate techniques for engineering applications
| 11 | | | CTPO : Contribution to programme outcomes, TOA :Type of assessment (1: written exam, 2: Oral exam, 3: Homework assignment, 4: Laboratory exercise/exam, 5: Seminar / presentation, 6: Term paper), LO : Learning Outcome | | |
| This course includes integer mathematical modeling and its solution algorithms, network optimization, dynamic programming, and nonlinear mathematical modeling. |
| |
| Course Syllabus | | Week | Subject | Related Notes / Files | | Week 1 | Introduction to Integer Optimization: Definition of integer optimization, Definition of pure integer and mixed integer models | | | Week 2 | Modeling of Integer Programming Problems: Special constraint structures, 0-1 Integer model examples (Set covering problem, Knapsack problem, etc.), Production planning problems | | | Week 3 | Solution Methods for Integer Optimization: Definition of branch and bound method, Branch and bound method rules, and branching strategies | | | Week 4 | Branch and Bound Method: Graphic and table methods | | | Week 5 | Cutting Plane Methods: Definition of Gomory (cutting) method, Cutting graphics | | | Week 6 | Primal (All-Integer) Cutting Method | | | Week 7 | 0-1 Branch and Bound Method: Solution of the backpack problem with the branch-bound method and GAMS applications | | | Week 8 | Network Optimization: Introduction and general concepts, Minimum spanning tree, and the Prim and Kruskal algorithms | | | Week 9 | Midterm | | | Week 10 | Network Optimization: Shortest path problem and the Dijsktra and Floyd algorithms | | | Week 11 | Network Optimization: Maximum flow problems, Max flow-Min cut theorem, Ford-Fulkerson algorithm, and GAMS applications | | | Week 12 | Dynamic Programming: Fundamentals of dynamic programming, mathematical formulations, and calculation methods | | | Week 13 | Dynamic Programming: Shortest path problems, knapsack problems, purchasing problems in manufacturing systems | | | Week 14 | Nonlinear Optimization: General concepts, unconstrained single and multivariate problems | | | Week 15 | Nonlinear Optimization: Constrained multivariate problems, Lagrange multipliers, Kuhn-Tucker conditions | | | Week 16 | Final | | | |
| 1 | Taha, H.,(2003), An Introduction to Operations Research, 7th Ed., Prentice Hall. | | | |
| 1 | Winston, W., (2004) "Operations Research: Applications and Algorithms" 4th Ed., Wadsworth Inc., USA | | | |
| Method of Assessment | | Type of assessment | Week No | Date | Duration (hours) | Weight (%) | | Mid-term exam | 9 | | 2 | 35 | | Quiz | 8
15 | | 0,5
0,5 | 10 | | Homework/Assignment/Term-paper | 5 | | | 5 | | End-of-term exam | 16 | 21/5/2019 | 2 | 50 | | |
| Student Work Load and its Distribution | | Type of work | Duration (hours pw) | No of weeks / Number of activity | Hours in total per term | | Yüz yüze eğitim | 3 | 14 | 42 | | Sınıf dışı çalışma | 2 | 14 | 28 | | Arasınav için hazırlık | 5 | 1 | 5 | | Arasınav | 2 | 1 | 2 | | Kısa sınav | .5 | 2 | 1 | | Dönem sonu sınavı için hazırlık | 5 | 1 | 5 | | Dönem sonu sınavı | 2 | 1 | 2 | | Total work load | | | 85 |
|