Print

COURSE INFORMATION
Course CodeCourse TitleL+P HourSemesterECTS
ISY 657DISCRETE OPTIMIZATION3 + 02nd Semester7,5

COURSE DESCRIPTION
Course Level Doctorate Degree
Course Type Elective
Course Objective The aim of this course is to introduce the dicrete optimization methods and to teach the students the integer programming techniques with practical examples.
Course Content Optimization, optimization models, integer programming, models for integer programming problems, integer programming solution methods, case studies.
Prerequisites No the prerequisite of lesson.
Corequisite No the corequisite of lesson.
Mode of Delivery Face to Face

COURSE LEARNING OUTCOMES
1Define optimization concept
2Define basic concepts of discrete optimization
3Define discrete optimization problems and methods
4Develop solution methods for integer programming problems

COURSE'S CONTRIBUTION TO PROGRAM
PO 01PO 02PO 03PO 04PO 05PO 06PO 07
LO 001       
LO 002       
LO 003       
LO 004       
Sub Total       
Contribution0000000

ECTS ALLOCATED BASED ON STUDENT WORKLOAD BY THE COURSE DESCRIPTION
ActivitiesQuantityDuration (Hour)Total Work Load (Hour)
Course Duration (14 weeks/theoric+practical)14342
Hours for off-the-classroom study (Pre-study, practice)14342
Assignments14342
Mid-terms11919
Final examination13030
Presentation / Seminar Preparation21020
Total Work Load

ECTS Credit of the Course






195

7,5
COURSE DETAILS
 Select Year   


 Course TermNoInstructors
Details 2018-2019 Fall1AYŞEGÜL TUŞ


Print

Course Details
Course Code Course Title L+P Hour Course Code Language Of Instruction Course Semester
ISY 657 DISCRETE OPTIMIZATION 3 + 0 1 Turkish 2018-2019 Fall
Course Coordinator  E-Mail  Phone Number  Course Location Attendance
Assoc. Prof. Dr. AYŞEGÜL TUŞ atus@pau.edu.tr İİBF B0006 %70
Goals The aim of this course is to introduce the dicrete optimization methods and to teach the students the integer programming techniques with practical examples.
Content Optimization, optimization models, integer programming, models for integer programming problems, integer programming solution methods, case studies.
Topics
WeeksTopics
1 Optimization models
2 General LP Models
3 Duality
4 Postoptimality and Sensitivity Analysis
5 Introduction to Integer Programming
6 Integer Programming Problems
7 Integer Programming Problems
8 Integer Programming Problems
9 Solving Methods for Integer Programming Problems
10 Solving Methods for Integer Programming Problems
11 Solving Methods for Integer Programming Problems
12 Solving Methods for Integer Programming Problems
13 Case studies
14 Case studies
Materials
Materials are not specified.
Resources
Course Assessment
Assesment MethodsPercentage (%)Assesment Methods Title
Final Exam50Final Exam
Midterm Exam50Midterm Exam
L+P: Lecture and Practice
PQ: Program Learning Outcomes
LO: Course Learning Outcomes