Course Details

DISCRETE OPTIMIZATION

IE415

Course Information
SemesterCourse Unit CodeCourse Unit TitleT+P+LCreditNumber of ECTS Credits
1IE415DISCRETE OPTIMIZATION3+0+035

Course Details
Language of Instruction English
Level of Course Unit Bachelor's Degree
Department / Program INDUSTRIAL ENGINEERING
Type of Program Formal Education
Type of Course Unit Elective
Course Delivery Method Face To Face
Objectives of the Course To provide an understanding of theory, algorithm and applications of combinatorial and integer optimization.
To formulate IP models for some real-life decision-making problems and show why one model might be “better” than another equivalent model.
Course Content This course introduces concepts, theories, and algorithms of integer and combinatorial optimization. Topics include modeling, comparison of alternative formulations, computational complexity, polyhedral theory, valid inequalities, cutting-plane algorithms, enumerative algorithms such as dynamic programming, branch-and-bound, branch-and-cut, heuristic algorithms and techniques to handle large problems such as Benders’ decomposition and delayed column generation (and branch-and-price). Applications include graphs, networks, transportation, and scheduling.
Course Methods and Techniques We will be using various tools for active learning to take place. This is also a student-driven course. It is your responsibility to participate actively in class discussions.
Prerequisites and co-requisities None
Course Coordinator None
Name of Lecturers Asist Prof.Dr. Rahime Şeyma Bekli seyma.bekli@agu.edu.tr
Assistants None
Work Placement(s) No

Recommended or Required Reading
Resources Wolsey, Laurence A. Integer Programming. Wiley-Interscience, 1998.
will be shared on canvas
canvas uzerinden paylasilacaktir
canvas uzerinden paylasilacaktir
canvas uzerinden paylasilacaktir

Course Category
Field %100

Planned Learning Activities and Teaching Methods
Activities are given in detail in the section of "Assessment Methods and Criteria" and "Workload Calculation"

Assessment Methods and Criteria
In-Term Studies Quantity Percentage
Yarıl yılSonu Sınavı/Dönem Projesinin Başarı Notuna Katkısı 1 % 20
Ödev 4 % 20
Proje/Çizim 1 % 35
Final examination 1 % 25
Total
7
% 100

 
ECTS Allocated Based on Student Workload
Activities Quantity Duration Total Work Load
Yazılı Sınav 1 3 3
Proje 34 1 34
Ders dışı çalışma 14 5 70
Yüz Yüze Ders 14 3 42
Final Sınavı 1 3 3
Total Work Load   Number of ECTS Credits 5 152

Course Learning Outcomes: Upon the successful completion of this course, students will be able to:
NoLearning Outcomes
1 Formulate appropriate problems in practice as combinatorial and mixed integer optimization problems.
2 Compare different models with each other.
3 Apply exact solution methods to solve these models.
4 Apply heuristic solution methods to solve these models.
5 Construct decomposition methods for large size problems.
6 Design a team project to solve a real-world problem with integer and combinatorial optimization and share the results of a real-world problem related team project (written and orally) with peers in a meaningful and professional manner.


Weekly Detailed Course Contents
WeekTopicsStudy MaterialsMaterials
1 Formulations and comparisons
2 Methods of strengthening formulations
3 Computational complexity for algorithms
4 Computational complexity for problem classes, P and NP classes
5 Simplex algorithm
6 Easily solvable problems, total unimodality
7 Dynamic programming
8 Fall break
9 Lecture Free Week Project Progress Presentations
10 Branch and bound algorithms , Heuristics
11 Polyhedron theory, valid inequalities and strengthening of them
12 Cutting plane algorithms, branch and cut
13 Lagrange relaxation, duality
14 Benders decomposition, column generation, branch and price algorithms
15 Project Presentations
16 Final Exam

Recommended Optional Programme Components
IE212 DETERMINISTIC OPTIMIZATION

Contribution of Learning Outcomes to Programme Outcomes
P1 P2 P3 P4 P5 P6 P7 P8 P9 P10 P11 P12
C1 3 3 3 3 2 1 1
C2 3 1 3 2
C3 1 2 1
C4 1 1 1 2 3
C5 1 1 1 3 2
C6 3 3 3 3 3 3 3 2 2 3 1 1

Contribution: 1: Very Slight 2:Slight 3:Moderate 4:Significant 5:Very Significant


https://sis.agu.edu.tr/oibs/bologna/progCourseDetails.aspx?curCourse=72421&lang=en