Print

COURSE INFORMATION
Course CodeCourse TitleL+P HourSemesterECTS
MUHY 576OPTIMIZATION TECHNICS3 + 02nd Semester6

COURSE DESCRIPTION
Course Level Doctorate Degree
Course Type Elective
Course Objective In this course the modelling of real life optimization problems and their solutions methods are examined in detail
Course Content Linear programming problems, integer programming problems, knapsack problems, location allocation problems, assembly line balancing problems, traveling salesman problems, scheduling problems
Prerequisites No the prerequisite of lesson.
Corequisite No the corequisite of lesson.
Mode of Delivery Face to Face

COURSE LEARNING OUTCOMES
1Understand the concept of modelling
2Models the real life problems
3Solve the models by using GAMS

COURSE'S CONTRIBUTION TO PROGRAM
PO 01PO 02PO 03PO 04PO 05PO 06PO 07PO 08PO 09PO 10
LO 001          
LO 002          
LO 003          
Sub Total          
Contribution0000000000

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)14570
Mid-terms12020
Final examination12424
Total Work Load

ECTS Credit of the Course






156

6
COURSE DETAILS
 Select Year   


 Course TermNoInstructors
Details 2016-2017 Spring1ÖZCAN MUTLU
Details 2015-2016 Spring1ÖZCAN MUTLU


Print

Course Details
Course Code Course Title L+P Hour Course Code Language Of Instruction Course Semester
MUHY 576 OPTIMIZATION TECHNICS 3 + 0 1 Turkish 2016-2017 Spring
Course Coordinator  E-Mail  Phone Number  Course Location Attendance
Assoc. Prof. Dr. ÖZCAN MUTLU mutlu@pau.edu.tr MUH A0457 %
Goals In this course the modelling of real life optimization problems and their solutions methods are examined in detail
Content Linear programming problems, integer programming problems, knapsack problems, location allocation problems, assembly line balancing problems, traveling salesman problems, scheduling problems
Topics
WeeksTopics
1 Basic concepts
2 Linear programming (LP) problems
3 LP aplications
4 LP aplications
5 Simplex algorithm
6 Simplex algorithm
7 Big M and thw phase method
8 Duality and dual simplex algorithm
9 Duality and dual simplex algorithm
10 Midterm exam
11 Sensitivity analysis
12 Transportation problems
13 Transportation problems
14 Assignment problems
Materials
Materials are not specified.
Resources
ResourcesResources Language
Operations Research Applications and Algorithms Wayne L. Winston, PWS-Kent Publishing CompanyEnglish
Yöneylem Araştırması, Hamdi Taha, Literatür YayınlarıTürkçe
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