Course Unit Code  Course Unit Title  Type of Course Unit  Year of Study  Semester  Number of ECTS Credits  İST412  INTEGER PROGRAMMING  Elective  4  8  5 

Level of Course Unit 
First Cycle 
Objectives of the Course 
The aim of this course is to enable students to understand the concept of integer optimization and its theoretical background, to have the ability to model optimization problems that can be expressed with the help of integer decision variables, and to understand the methods that solve such problems. 
Name of Lecturer(s) 
Doç. Dr. Ali MERT 
Learning Outcomes 
1  To be able to distinguish integer optimization problems from different optimization problems.  2  To be able to comprehend the theoretical background necessary to solve integer optimization problems  3  To be able to model an integer optimization problem.  4  To be able to express a mathematical model of an integer optimization problem graphically.  5  To be able to choose the most appropriate method to solve an integer optimization problem.  6  To be able to express the algorithmic methods used to solve integer optimization problems.  7  Solve an integer optimization problem  8  To be able to interpret the results of a given integer optimization problem. 

Mode of Delivery 
Face to Face 
Prerequisites and corequisities 
 
Recommended Optional Programme Components 
 
Course Contents 
General information about optimization. Basic information for integer optimization. Types of integer optimization problems. Wellknown models used in modeling integer optimization problems. Approaches used to solve integer optimization problems. Approaches used to solve approximate optimization problems. 
Weekly Detailed Course Contents 

1  General information about optimization. Theoretical foundations of optimization    2  Theoretical basis of integer optimization. Top favor, relaxation and boundary concepts    3  Backpack problems, Capital budgeting problems and fixed load problems.    4  Machine placement problems, Cluster cover, packaging and separation problems    5  Eitheror constrained problems, Ifthen constrained problems, Partial linear objective function and machine sequential problems.    6  Traveler seller and route models.    7  Solution of total counting and rounding of linear programming solutions to integers    8  Midterm Examination    9  Balas algorithm and its applications.    10  Branch  bound method and its applications to different problems    11  Greedy method and its application to different problems.    12  Basic information about GAMS.    13  Problem solutions with GAMS.    14  Problem solutions with GAMS.    15  Problem solutions with GAMS.    16  Final Examination   

Recommended or Required Reading 
Textbooks:
1. Tamsayılı Programlama: Teori, Modeller ve Algoritmalar, M. Akif Bakır ve Bülent Altunkaynak, Nobel Yayın, 2003.
2. Tamsayılı Programlama Algoritmaları ve Bilgisayar Uygulamalı Problem Çözümleri, Zehra Başkaya, Ekin Kitabevi, 2005.
Auxiliary Books:
3. Integer Programming, Laurence A. Wolsey, John Wiley and Sons Inc., 1998.
4. Integer and Combinatorial Optimization, George L. Nemhauser and Laurence A. Wolsey, John Wiley and Sons Inc., 1988

Planned Learning Activities and Teaching Methods 

Assessment Methods and Criteria   Language of Instruction  English  Work Placement(s)   

Workload Calculation 