END 331E • Midterm II + Final • Operations Research I
Bu dersimizde matematiksel modellemenin temel prensiplerini öğrenerek, önümüzdeki dönemlerde öğreneceğiniz Simülasyon ve Stokastik Modelleme gibi derslerin temellerini atacaksanız.
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
Matrix Form and Revised Simplex
8 topic lessons
Matrices of LP
Example 1
Forming a Table with Given BV
Example 2
Simplex Method in Matrix Form
Example 3
Revised Simplex
Example 4
Dual Simplex Method
6 topic lessons
Idea Behind Dual Simplex
Comparing Primal/Dual Simplex
Example 1
Example 2
Combining with Primal Simplex
Example 3
Sensitivity Analysis
16 topic lessons
General Procedure
Changing Coefficients of a Non-Basic Variable
Example 1
Example 2
Introducing a New Variable
Example 3
Example 4
Changing Right-Hand-Side of a Constraint
Example 5
Example 6
Introducing a New Constraint
Example 7
Example 8
Changing Coefficients of a Basic Variable
Example 9
Example 10
The Transportation Problem
12 topic lessons
Definition / LP Solution
Assumptions of the Problem
Least Cost Solution
Example 1
Northwest Corner Solution
Example 2
Vogel's Method
Example 3
Transportation Simplex Method
Example 4
Example 5
Example 6
The Assignment Problem
6 topic lessons · 1 question
Definition / LP Solution
Assumptions of the Problem
Hungarian Method
Hungarian Method: Trouble in Paradise
Example 1
Example 2
Exam-like Question 1
Network Models: Shortest Path Problems
8 topic lessons
What is a network?
Shortest Path Problems
Dijkstra's Algorithm
Example 1
Example 2
Example 3
Example 4
Example 5
Past Exam Problems
19 questions
Matrix Form 1
Matrix Form 2
Revised Simplex 1
Revised Simplex 2
Dual Simplex Method 1
Dual Simplex Method 2
Dual Simplex Method 3
Dual Simplex Method 4
Dual Simplex Method 5
Transportation Problem 1
Transportation Problem 2
Assignment Problem 1
Assignment Problem 2
Assignment Problem 3
Network Models: Shortest Path Problem 1
Network Models: Shortest Path Problem 2
Network Models: Shortest Path Problem 3
Network Models: Shortest Path Problem 4
Network Models: Shortest Path Problem 5
Reviews
4 student reviews
Only students who have this course can review it.
Selim Arman
Bought the courseEndüstri Mühendisliği
Kübra Bilir
Bought the courseEndüstri Mühendisliği
K A
Bought the courseEndüstri Mühendisliği
Kazım Timuçin Utkan
Bought the courseEndüstri Mühendisliği
Buy both together
🎓 92% of İstanbul Teknik Üniversitesi students study with the whole bundle.
