IE 202 • Final • Operations Research I: Linear Models
Endüstri Mühendisliği'nin en temel dersi olan Operations Research'te konu yoğunluğu, çözüm yöntemlerinin uzunluğu ve ucu açık soru tipleri öğrencileri zorlayan sebeplerden sadece bazıları. Unicourse bu kapsamlı dersiyle bütün problemlere bir çare!
499 TL a month, 3 instalments at no extra cost
Instructor

Ömer Faruk Altun
Co-founder & Head of Education
2011 yılında Endüstri Mühendisliği okumak için başladığım Sabancı Üniversitesi'nden 2018 yılında Bilgisayar Mühendisi olarak mezun oldum. 13 yıldır Altun ismiyle başta Sabancı Üniversitesi olmak üzere çeşitli okullarda Endüstri ve Bilgisayar Mühendisliği alanlarında ders vermekteyim. Unicourse'ta sunduğum derslerin yanında eğitim departmanının da sorumluluğunu üstlenmekteyim.
Pass guarantee
We trust our courses. If you prepare for your exams with us and still fail the course, you can get a refund. Terms
Topics
Transportation Problem
12 topic lessons
Definition / LP Solution
Assumptions of the Problem
Least Cost Method
Example
Northwest Corner Method
Example
Vogel's Method
Example
Transportation Simplex Method
Example
Example
Example
Assignment Problem
6 topic lessons
Definition / LP Solution
Assumptions of the Problem
Hungarian Method
Hungarian Method: Trouble in Paradise
Hungarian Method Example 1
Hungarian Method Example 2
🦄🦄 SAMPLE EXAM PROBLEMS - PART 1 🦄🦄
9 questions
Transportation Problem
Transportation Problem
Transportation Problem
Assignment Problem
Assignment Problem
Assignment Problem
Assignment Problem
Assignment Problem
Assignment Problem
Network Models - Shortest Path Problems
8 topic lessons
What is a network?
Shortest Route Problems
Dijkstra's Algorithm
Example 1
Example 2
Example 3
Example 4
Example 5
Network Models - Maximum Flow Problems
5 topic lessons
Maximum Flow Problems
Minimum Cut
Flow Augmenting Path Algorithm
Example 1
Example 2
🦄🦄 SAMPLE EXAM PROBLEMS - PART 2 🦄🦄
7 questions
Shortest Path Problem
Shortest Path Problem
Shortest Path Problem
Shortest Path Problem
Maximum Flow Problem
Maximum Flow Problem
Maximum Flow Problem
Integer Programming Modeling
8 topic lessons
What is Integer Programming?
Example - Fixed Cost Problems
Constraints with Binary Variables
Special Constraints
If-then --> Either-or
Example - Assignment Problem
Example - Knapsack Problem
Example - Set Covering Problem
Branch and Bound Method
5 topic lessons
Branch
Bound
Example 1
Example 2
Example 3
Cutting Plane Algorithm
8 topic lessons
Valid Inequalities
Example 1
Chvàtal Gomory Rounding Procedure
Cutting Plane and Ideal Formulation
Gomory Fractional Cutting Plane
Cutting Plane Algorithm
Example 2
Example 3
🦄🦄 SAMPLE EXAM PROBLEMS - PART 3 🦄🦄
19 questions
Integer Programming
Integer Programming
Integer Programming
Integer Programming
Integer Programming
Integer Programming
Integer Programming
Integer Programming
Integer Programming
Integer Programming
Branch and Bound
Branch and Bound
Branch and Bound
Branch and Bound
Cutting Plane
Cutting Plane
Cutting Plane
Cutting Plane
Cutting Plane
Reviews
1 student review
Only students who have this course can review it.
Ayberk Selvi
Bought the courseEndüstri Mühendisliği
Complete the bundle
🎓 92% of Boğaziçi Üniversitesi students study with the whole bundle.

IE 202 • Final
Operations Research I: Linear Models
1268 TL

IE 202 • Midterm - Part I
Operations Research I: Linear Models
1015 TL

IE 202 • Midterm - Part II
Operations Research I: Linear Models
1015 TL