Home  »  Institute of Science »  Ph.D.On Industrial Engineering

COURSE UNIT TITLECOURSE UNIT CODESEMESTERTHEORY + PRACTICE (Hour)ECTS
INTEGER PROGRAMMING END622 Program Course List------ 3 + 0 10

TYPE OF COURSE UNITElective Course
LEVEL OF COURSE UNITDoctorate Of Science
YEAR OF STUDY-
SEMESTERProgram Course List------
NUMBER OF ECTS CREDITS ALLOCATED10
NAME OF LECTURER(S)Professor İmdat Kara
LEARNING OUTCOMES OF THE COURSE UNIT At the end of this course, the students;
1) Knowing the basics of integer programming
2) Learning the solution methods of integer programming models
3) Knowing the applications of integer programming and having ability to develop integer programming models and to solve them
MODE OF DELIVERYFace to face
PRE-REQUISITES OF THE COURSENo
RECOMMENDED OPTIONAL PROGRAMME COMPONENTNone
COURSE DEFINITIONMethods and models of integer programming. Variants of integer programming models, pure and mixed integer models. Enumeration techniques, 0-1 integer programming and branch and bound method. Combinatorial optimization, heuristic methods and the applications of dynamic programming. Non-linear integer programming models. Resource distribution, plant layout, integer programming approaches for scheduling and budgeting.
COURSE CONTENTS
WEEKTOPICS
1st Week Methods for integer programming
2nd Week Models for integer programming
3rd Week Variations of integer programming models
4th Week Integer programming models and mixed integer programming models
5th Week Enumeration techniques
6th Week 0-1 integer programming
7th Week Branch-and-Bound method
8th Week Midterm
9th Week Combinatorial optimization
10th Week Heuristic methods and Dynamic Programming applications
11th Week Non-linear integer models
12th Week Resource allocation
13th Week Facility location and layout and, integer programming in scheduling and
14th Week budgeting
15th Week Project Presentation
RECOMENDED OR REQUIRED READING1. Wolsey, L.A., Integer Programming, Awiley-Interscience Publication New York, 1998.
2. Nemhauser, G., Integer and combinatorial optimization, Awiley-Interscience Publication New York, 1999.
3. Bazaraa M.S., Jarvis J.J., Sherali H.D., 1990, Linear Programming and Network Flows 2nd ed., John Wiley & Sons
4. Hillier F.S., Lieberman G.J., 2001, Introduction to Operations Research (7th ed.), Mc Graw-Hill
PLANNED LEARNING ACTIVITIES AND TEACHING METHODSLecture,Questions/Answers,Problem Solving,Practice,Presentation
ASSESSMENT METHODS AND CRITERIA
 QuantityPercentage(%)
Mid-term125
Assignment420
Project120
Attendance15
Total(%)70
Contribution of In-term Studies to Overall Grade(%)70
Contribution of Final Examination to Overall Grade(%)30
Total(%)100
LANGUAGE OF INSTRUCTIONTurkish
WORK PLACEMENT(S)No
  

KEY LEARNING OUTCOMES (KLO) / MATRIX OF LEARNING OUTCOMES (LO)
LO1LO2LO3
K1  X   X   X
K2  X   X  
K3  X   X  
K4    X   X
K5    X  
K6     
K7     
K8     
K9     
K10     
K11