Description of Individual Course Units
 Course Unit Code Course Unit Title Type of Course Unit Year of Study Semester Number of ECTS Credits İST316 DISCRETE OPTIMIZATION Elective 3 6 4
Level of Course Unit
First Cycle
Language of Instruction
English
Objectives of the Course
Dicsrete optimization; deals with problems with linear constraints and linear objective functions and some or all of their variables are integers. In this course, mathematical modeling of such problems is mentioned. Moreover, mathematical background and methods for solving such problems are presented.
Name of Lecturer(s)
Doç.Dr.Ali MERT
Learning Outcomes
 1 To understand optimality, relaxation and boundaries. 2 To be able to use and learn optimization methods that solve integer and combinatorial optimization problems. 3 To learn branch boundary methods, dynamic programming and heuristic methods.
Mode of Delivery
Face to Face
Prerequisites and co-requisities
No
Recommended Optional Programme Components
No
Course Contents
Integer programming problems and their applications, concept of optimality, concept of loosening, types of network problems, linear algebra and related concepts, optimization methods, approximate algorithms, binary.
Weekly Detailed Course Contents
 Week Theoretical Practice Laboratory 1 Introduction, Basic Concepts 2 Mixed Integer Problems and Applications 3 Optimality and Relaxations, Linear Programming Relaxations 4 Network Problems 5 Linear Algebra and Convexity 6 Convex Hull, Current Inequalities 7 Plane Cutting Methods 8 Midterm 9 Branch-Bound Method, Branching Methods and Search Strategies 10 Branch and Cutting Method 11 Dynamic Programming 12 Dynamic Programming 13 Heuristic Algorithms 14 Heuristic Algorithms 15 Lagrange Relaxation and Duality 16 Final exam
- G. Nemhauser and L. Wolsey, Integer Programming and Combinatorial Optimization, Wiley, 1988 - D. Bertsimas and R. Weismantel, Optimization over Integers, Dynamic Ideas, 2005 - A. Schrijver, Theory of Linear and Integer Programming, Wiley, 1986 - D. Chen, R. G. Batson, and Y. Dang, Applied Integer Programming: Modeling and Solution, Wiley, 2010
Planned Learning Activities and Teaching Methods
Activities are given in detail in the sections of "Assessment Methods and Criteria" and "Workload Calculation".
Assessment Methods and Criteria
 Term (or Year) Learning Activities Quantity Weight Midterm Examination 1 100 SUM 100 End Of Term (or Year) Learning Activities Quantity Weight Final Sınavı 1 100 SUM 100 Term (or Year) Learning Activities 40 End Of Term (or Year) Learning Activities 60 SUM 100
Work Placement(s)
No