Course Information
SemesterCourse Unit CodeCourse Unit TitleT+P+LCreditNumber of ECTS Credits
5END321Operations Research Iı3+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 being taught the Integer Programming, Target Programming, Dynamic Programming, Game Theory and solution procedures, which are among the Operations Research Subjects, and thus the policies and activities of the management are scientifically determined.
Course Content 1. TRANSPORTATION AND ASSIGNMENT PROBLEMS
1.1 DEFINITION AND APPLICATION OF TRANSPORTATION PROBLEMS
1.2 FINDING THE INITIAL BASIC SOLUTION TO BALANCED TRANSPORTATION PROBLEMS
1.3 TRANSPORTATION SYMPLEX METHOD
1.4 SENSITIVITY ANALYSIS OF TRANSPORTATION PROBLEMS
1.5 ASSIGNMENT PROBLEMS
2. INTEGER PROGRAMMING
2.1 INTRODUCTION TO INTEGER PROGRAMMING
2.2 MODELING INTEGER PROGRAMMING PROBLEMS
2.3 SOLUTION APPROACHES IN INTEGER PROGRAMMING
2.4 BRANCH AND BOUNDARY ALGORITHM
3. GOAL PROGRAMMING
3.1 MODELING GOAL PROGRAMMING PROBLEMS
3.1.1 Non-Priority Goal Programming
3.1.2 Priority Goal Programming
3.2 SOLUTION OF GOAL PROGRAMMING MODELS
3.2.1 Simplex Algorithm in Goal Programming
3.2.2 Computer Solution of Primary Target Programming Problems
4. DYNAMIC PROGRAMMING
4.1 ELEMENTS OF A DYNAMİC PROGRAMING
4.1.1 Key features
4.1.2 Mathematical Formulation and Calculation Method
4.2 Deterministic Dynamic Programming
4.2.1 Shortest Path Problems
4.2.2 Resource Distribution Problems
4.2.3 Backpack Problems
4.2.4 Production-Purchasing Problems
4.3 PROBABILISTIC DYNAMIC PROGRAMMING
5. GAME THEORY
5.1 DEFINITIONS
5.2 TYPES OF GAME SITUATIONS
5.3 TWO-PLAYER ZERO-SUM GAMES
5.3.1 Equilibrium Point and Stable Games
5.3.2 Superior Strategies and Defeating
5.3.3 Unstable Games
5.3.4 Graphical Solution Method: 2x2, mx2 and 2xn Size Games
5.3.5 Modeling with Linear Programming
5.4 TWO-PLAYER FIXED-SUM GAMES
5.5 TWO-PLAYER NON-FIXED-SUM GAMES
5.6 N–PERSON GAMES
Course Methods and Techniques
Prerequisites and co-requisities None
Course Coordinator None
Name of Lecturers Asist Prof. Özer Öztürk ozer.ozturk@gedik.edu.tr
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 %30
Engineering %70

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 % 35
Quizzes 5 % 25
Final examination 1 % 40
Total
7
% 100

 
ECTS Allocated Based on Student Workload
Activities Quantity Duration Total Work Load
Course Duration 14 3 42
Hours for off-the-c.r.stud 14 4 56
Mid-terms 6 5 30
Final examination 1 20 20
Total Work Load   Number of ECTS Credits 6 148

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 Student gains the ability to solve assignment transportation, integer, goal and dynamic programming models and game theory problems.


Weekly Detailed Course Contents
WeekTopicsStudy MaterialsMaterials
1 1. TRANSPORTATION AND ASSIGNMENT PROBLEMS 1.1 DEFINITION AND APPLICATION OF TRANSPORTATION PROBLEMS 1.2 FINDING THE INITIAL BASIC SOLUTION TO BALANCED TRANSPORTATION PROBLEMS Course Notes
2 1.3 TRANSPORTATION SYMPLEX METHOD 1.4 SENSITIVITY ANALYSIS OF TRANSPORTATION PROBLEMS 1.5 ASSIGNMENT PROBLEMS Course Notes
3 2. INTEGER PROGRAMMING 2.1 INTRODUCTION TO INTEGER PROGRAMMING 2.2 MODELING INTEGER PROGRAMMING PROBLEMS Course Notes
4 2.3 SOLUTION APPROACHES IN INTEGER PROGRAMMING Course Notes
5 2.4 BRANCH AND BOUNDARY ALGORITHM Course Notes
6 3. GOAL PROGRAMMING 3.1 MODELING GOAL PROGRAMMING PROBLEMS 3.1.1 Non-Priority Goal Programming Course Notes
7 3.1.2 Priority Goal Programming Course Notes
8 EXAM
9 3.2 SOLUTION OF GOAL PROGRAMMING MODELS 3.2.1 Simplex Algorithm in Goal Programming 3.2.2 Computer Solution of Primary Goal Programming Problems Course Notes
10 4. DYNAMIC PROGRAMMING 4.1 ELEMENTS OF A DYNAMİC PROGRAMING 4.1.1 Key features 4.1.2 Mathematical Formulation and Calculation Method Course Notes
11 4.2 Deterministic Dynamic Programming 4.2.1 Shortest Path Problems 4.2.2 Resource Distribution Problems Course Notes
12 4.2.3 Backpack Problems 4.2.4 Production-Purchasing Problems Course Notes
13 DERTERMINISTIC DYNAMIC PROGRAMING, Shortest Path Problems, Resource Allocation Problems, Backpack Problems, Production–Purchasing Problems Course Notes
14 5. GAME THEORY 5.1 DEFINITIONS 5.2 TYPES OF GAME SITUATIONS 5.3 TWO-PLAYER ZERO-SUM GAMES 5.3.1 Equilibrium Point and Stable Games 5.3.2 Superior Strategies and Defeating 5.3.3 Unstable Games 5.3.4 Graphical Solution Method: 2x2, mx2 and 2xn Size Games 5.3.5 Modeling with Linear Programming Course Notes
15 5.4 TWO-PLAYER FIXED-SUM GAMES 5.5 TWO-PLAYER NON-FIXED-SUM GAMES 5.6 N–PERSON GAMES 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 4 4
C3 4 4

bbb


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