Print

COURSE INFORMATION
Course CodeCourse TitleL+P HourSemesterECTS
CENG 430OPERATIONAL RESEARCH3 + 06th Semester5

COURSE DESCRIPTION
Course Level Bachelor's Degree
Course Type Elective
Course Objective Bilgisayar mühendislerine yöneylem araştırmasını tanıtmak için tasalanmış bir derstir. Bu dersin amacı öğrencilere, üretimde ve ekonomide karşılaşılan problemlerin modellemesini ve bilimsel olarak karar vermek için gerekli temel yöneylem araştırması araçlarını öğretmektir.
Course Content Concept of optimization, development of decision models, graphical solution method, simplex algorithm, two-phase simplex algorithm, big M method, transportation problems, assignment problems, shortest path problems, minimum spanning tree problems, maximum flow problems, minimum cost network flow problems.
Prerequisites No the prerequisite of lesson.
Corequisite No the corequisite of lesson.
Mode of Delivery Face to Face

COURSE LEARNING OUTCOMES
1-

COURSE'S CONTRIBUTION TO PROGRAM
PO 01PO 02PO 03PO 04PO 05PO 06PO 07PO 08PO 09PO 10PO 11PO 12
LO 001232543542354
Sub Total232543542354
Contribution232543542354

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)14456
Mid-terms11515
Final examination11717
Total Work Load

ECTS Credit of the Course






130

5
COURSE DETAILS
 Select Year   


 Course TermNoInstructors
Details 2021-2022 Spring2MEHMET ULAŞ KOYUNCUOĞLU


Print

Course Details
Course Code Course Title L+P Hour Course Code Language Of Instruction Course Semester
CENG 430 OPERATIONAL RESEARCH 3 + 0 2 Turkish 2021-2022 Spring
Course Coordinator  E-Mail  Phone Number  Course Location Attendance
Asts. Prof. Dr. MEHMET ULAŞ KOYUNCUOĞLU ulas@pau.edu.tr İİBF AB112 %70
Goals Bilgisayar mühendislerine yöneylem araştırmasını tanıtmak için tasalanmış bir derstir. Bu dersin amacı öğrencilere, üretimde ve ekonomide karşılaşılan problemlerin modellemesini ve bilimsel olarak karar vermek için gerekli temel yöneylem araştırması araçlarını öğretmektir.
Content Concept of optimization, development of decision models, graphical solution method, simplex algorithm, two-phase simplex algorithm, big M method, transportation problems, assignment problems, shortest path problems, minimum spanning tree problems, maximum flow problems, minimum cost network flow problems.
Topics
WeeksTopics
1 Operations research basic concepts and its history
2 Operations research application areas
3 Linear programming
4 Feasible solution
5 Simplex algorithm
6 Simplex algorithm
7 Duality in linear programming
8 Transportation problem
9 The North-West corner method
10 Minimum cost method
11 Vogel’s approximation method
12 Assignment Problem
13 Assignment Problem
14 Shortest path problem
Materials
Materials are not specified.
Resources
ResourcesResources Language
Taha, H. A., (2001), "Yöneylem Araştırması", Literatür Yayıncılık, 6. Basım.Türkçe
Winston, W. L., (2003). "Operation Research: Application and Algorithms", Duxbury Press, 4. Basım.English
Course Assessment
Assesment MethodsPercentage (%)Assesment Methods Title
Final Exam60Final Exam
Midterm Exam40Midterm Exam
L+P: Lecture and Practice
PQ: Program Learning Outcomes
LO: Course Learning Outcomes