Course Information
SemesterCourse Unit CodeCourse Unit TitleT+P+LCreditNumber of ECTS Credits
6END322 Optimization Models And Applications3+0+036

Course Details
Language of Instruction Turkish
Level of Course Unit Bachelor's Degree
Department / Program Industrial Engineering
Mode of Delivery Face to Face
Type of Course Unit Compulsory
Objectives of the Course The aim of this course is to teach the theory and solution procedures of Integer Programming, Network Models, Inventory Models and Well Models, which is one of the operations research topics, and thus to ensure the scientific determination of the policies and activities of management.
Course Content Integer Linear Programming and Algorithms; Network Models: Minimum Covering Tree Algorithm; Shortest Path Problem and Algorithms; Maximal Flow Algorithm; Minimum Cost Capacity Flow Problem and Algorithm; CPM-PERT; Deterministic Stock Models; Tail Theory and Tail Models
Course Methods and Techniques
Prerequisites and co-requisities None
Course Coordinator None
Name of Lecturers Asist Prof. Mahmut Sayar
Assistants None
Work Placement(s) No

Recommended or Required Reading
Resources Taha, H. A. (2007). Operations research: an introduction.

Course Category
Mathematics and Basic Sciences %70
Engineering %30

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
Mid-terms 1 % 40
Final examination 1 % 60
Total
2
% 100

 
ECTS Allocated Based on Student Workload
Activities Quantity Duration Total Work Load
Course Duration 14 3 42
Total Work Load   Number of ECTS Credits 2 42

Course Learning Outcomes: Upon the successful completion of this course, students will be able to:
NoLearning Outcomes
1 Students gain the skill of optimization
2 Student can model and solve real life problems.
3 Students will be able to solve inventory models, network models and queuing models.


Weekly Detailed Course Contents
WeekTopicsStudy MaterialsMaterials
1 Introduction to Integer Linear Programming; Illustrative Examples; Integer Linear Programming Algorithms, Branch-Boundary Algorithm Course Notes
2 Cutting Plane Algorithm Course Notes
3 Network Models; Scope of network applications; Network definitions; Minimal Spanning Tree (Mininal Span) Algorithm Course Notes
4 Shortest Path Problem; Examples of the shortest path applications; Shortest Path Algorithms; Maximum Flow Model; Maximum Flow Algorithm Course Notes
5 Minimum flow capacity flow problem; Network Representation: Linear Programming formulation; Simplex Algorithm for network with minimum cost capacity Course Notes
6 CPM-PERT; Network display; Critical path method and critical path calculations; Creating the timeline Course Notes
7 Explanation of Project Evaluation and Review Technique and Case Studies Course Notes
8 EXAM
9 ESM Models in case of possession of goods Course Notes
10 Production Model; production model in case of lack of goods Course Notes
11 Price discount economical order quantity model Course Notes
12 Dynamic Economic Order Quantity Models Course Notes
13 Introduction to Queuing Theory and Queuing Systems; Basic Components of Queue Models; The Role of Exponential Distribution Course Notes
14 Models of Pure Birth and Death; Generalized Poisson Tail Model Course Notes


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

bbb


https://obs.gedik.edu.tr/oibs/bologna/progCourseDetails.aspx?curCourse=205016&curProgID=5582&lang=en