Course Information

Semester	Course Unit Code	Course Unit Title	T+P+L	Credit	Number of ECTS Credits	Last Updated Date
6	EDS302	Operations Research II	2+2+0	3	4	18.03.2026

Course Details

Language of Instruction	Turkish
Level of Course Unit	Bachelor's Degree
Department / Program	Industrial Engineering
Type of Program	Formal Education
Type of Course Unit	Compulsory
Course Delivery Method	Face To Face
Objectives of the Course	Assignment Problems, Transportation Problems, Integer Programming, Objective Programming, Dynamic Programming, Game Theory are taught more advanced topics and solution techniques in the field of operations research, thus providing students with the skills to solve complex problems encountered in the business world or engineering.
Course Content	Assignment Problems, Transportation Problems, Integer Programming, Objective Programming, Dynamic Programming, Game Theory
Course Methods and Techniques
Prerequisites and co-requisities	None
Course Coordinator	None
Name of Lecturers	Asist Prof. ....
Assistants	None
Work Placement(s)	No

Recommended or Required Reading

Resources	Winston, Wayne L., “Operations Research: Applications and Algorithms”, Fourth Edition, Brooks/Cole-Thomson Learning, 2004.
Course Notes	1. Hamdy A Taha, “Operations Research: An Introduction”, 8th Edition, Pearson Education, Inc., 2002. 2. Öztürk, A., Yöneylem Araştırması, Ekin Yayınevi, Bursa, 2016.

Course Category

Mathematics and Basic Sciences	%30
Engineering	%50
Engineering Design	%20

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	% 30
Quizzes	2	% 20
Final examination	1	% 50
Total	4	% 100

ECTS Allocated Based on Student Workload

Activities	Quantity	Duration	Total Work Load
Course Duration	14	2	28
Hours for off-the-c.r.stud	14	2	28
Mid-terms	3	3	9
Practice	14	2	28
Final examination	1	10	10
Total Work Load			Number of ECTS Credits 4 103

Course Learning Outcomes: Upon the successful completion of this course, students will be able to:

No	Learning Outcomes
1	Students can analyze the problem by using basic knowledge of mathematics and engineering for assignment problems, construct a linear programming model of the problem, and find the optimal solution to the problem using the Hungarian Algorithm technique.
2	Students can analyze the problem using basic mathematical and engineering knowledge for transportation problems, construct a linear programming model of the problem, find the appropriate initial solution with the Northwest Corner Method, Lowest Costs Method or VOGEL methods, and find the optimal solution of the problem using the Transportation Simplex Algorithm method
3	Students can analyze the problem by using basic mathematics and engineering knowledge for integer problems, build the model of the problem, and find the optimal solution of the problem by using the Branch-Boundary Algorithm technique.
4	Students can analyze the problem by using basic mathematical and engineering knowledge for priority target programming problems, build a model of the problem, and find the optimal solution to the problem by using the Priority Target Programming Simplex Algorithm technique.
5	Students can analyze the problem by using basic mathematical and engineering knowledge for non-priority target programming problems, build a model of the problem, find the optimal solution of the problem by using the Non-Priority Target Programming Simplex Algorithm technique.
6	Students can analyze the problem by using basic mathematics and engineering knowledge for dynamic programming problems, build the model of the problem, and find the optimal solution of the problem with Dynamic Programming techniques.
7	Students can analyze the problem by using basic mathematics and engineering knowledge for game theory problems, build a model of the problem, calculate optimal karma strategies and the value of the game with Game Theory techniques.

Weekly Detailed Course Contents

Week	Topics	Study Materials
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	P4
All	3	5	5
C1	3	5	5
C2	3	5	5
C3	3	5	5
C4	3	5	5
C5	3	5	5
C6	3	5	5
C7	3	5	5

bbb

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