|
|
| BILB3019 | Integer Programming | 4+0+0 | ECTS:4 | | Year / Semester | Fall Semester | | Level of Course | First Cycle | | Status | Elective | | Department | COMPUTER SCIENCE | | Prerequisites and co-requisites | None | | Mode of Delivery | | | Contact Hours | 14 weeks - 4 hours of lectures per week | | Lecturer | Dr. Öğr. Üyesi Serkan AKBAŞ | | Co-Lecturer | Prof. Dr. Türkan ERBAY DALKILIÇ | | Language of instruction | Turkish | | Professional practise ( internship ) | None | | | | The aim of the course: | | Introduce the students to the integer programming problems, various techniques for solving integer programming problems and the concept of optimization. |
| Learning Outcomes | CTPO | TOA | | Upon successful completion of the course, the students will be able to : | | | | LO - 1 : | Develop an integer programming model for the given problem. | 2,4,5,11 | 1, | | LO - 2 : | Find integer solutions for the developed integer programming model. | 2,4,5,11 | 1, | | LO - 3 : | Can modeling and solving the real-world problems. | 2,4,5,11 | 1, | | LO - 4 : | Learn the solution methods of integer programming models. | 2,4,5,11 | 1, | | 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 | | |
|
Integer programming, game theory, decision theory, network models, multi criteria decision and dynamic programming subjects are giving in this course. Construct mathematical models of this problems and special solution methods of this problems are explain. |
| |
| Course Syllabus | | Week | Subject | Related Notes / Files | | Week 1 | Introduction to integer programming | | | Week 2 | Formulation of integer programming problems | | | Week 3 | Branch bound technique | | | Week 4 | Branch bound technique for knapsack problem | | | Week 5 | Game theory | | | Week 6 | Decision analysis, decision making under uncertainty and risk | | | Week 7 | Decision trees and utility theory | | | Week 8 | Network models, shortest path problem, Dijkstra algorithm, maximum flow problems, solving linear programming | | | Week 9 | Mid-term exam | | | Week 10 | Minimum cost network flow problems minimum spanning tree problems | | | Week 11 | Multi-criteria decision making, scoring method, Analytic hierarchy process, TOPSIS | | | Week 12 | Goal programming | | | Week 13 | Introduction to Dynamic programming | | | Week 14 | Stock planning and solution of distribution problems with dynamic programming | | | Week 15 | Application with WinQSB | | | Week 16 | End of term exam | | | |
| 1 | Wolsey, L.A., Integer Programming, Awiley-Interscience Publication New York, 1998. | | | |
| 1 | Nemhauser, G., Integer and combinatorial optimization, Awiley-Interscience Publication New York, 1999. | | | |
| Method of Assessment | | Type of assessment | Week No | Date | Duration (hours) | Weight (%) | | Mid-term exam | 9 | | 1.5 | 50 | | End-of-term exam | 16 | | 1.5 | 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 | 4 | 14 | 56 | | Sınıf dışı çalışma | 3 | 14 | 42 | | Arasınav için hazırlık | 10 | 1 | 10 | | Arasınav | 1.5 | 1 | 1.5 | | Dönem sonu sınavı için hazırlık | 17 | 1 | 17 | | Dönem sonu sınavı | 1.5 | 1 | 1.5 | | Total work load | | | 128 |
|