IE 333 • Final • Operations Research II - Deterministic Problems
Tamamen yöntemlere dayalı bu derste de birinci kaynağın Unicourse!
Her metodu derinlemesine işlediğimiz ve çözümlü örneklerle son noktayı koyduğumuz bu dersle IE 333 çok kolay!
599 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 and Initial Solutions
10 topic lessons
Definition / LP Solution
Assumptions of the Problem
Least Cost Method
Least Cost Method Example 1
Least Cost Method Example 2
Northwest Corner Method
Northwest Corner Method Example 1
Northwest Corner Method Example 2
Vogel's Method
Vogel's Method Example 1
Transportation Simplex Method
4 topic lessons
Transportation Simplex Method
Example 1
Example 2
Example 3
Assignment Problem and Hungarian Method
6 topic lessons
Definition / LP Solution
Assumptions of the Problem
Hungarian Method
Hungarian Method: Trouble in Paradise
Example 1
Example 2
Dijkstra's Algorithm
8 topic lessons
What is a network?
Shortest Path Problems
Dijkstra's Algorithm
Djikstra's Algorithm Example 1
Djikstra's Algorithm Example 2
Shortest Path Problem Example 1
Shortest Path Problem Example 2
Shortest Path Problem Example 3
Network Simplex Method
4 topic lessons
General Procedure
Initial BFS
Iterations
Example
Branch and Bound Method
6 topic lessons
Introduction
Example 1
Example 2
An Important Question
Knapsack Problem and Branch&Bound
Knapsack Problemi B&B Example
Cutting Plane Algorithm
3 topic lessons
Method
Example 1
Example 2
Dynamic Programming
5 topic lessons
A New Approach to Optimization Problems
Inventory Problems
Inventory Problems Example 1
Resource Allocation Problems
Resource Allocation Problems Example 1
Non-Linear Programming (NLP)
7 topic lessons
What is NLP?
One Variable Unconstrained Optimization
Convexity in Detail
Multivariable Unconstrained Optimization
Convexity in Detail
KKT Conditions
Example
Past Final Problems
32 questions
Transportation Simplex Method 1
Transportation Simplex Method 2
Hungarian Method 1
Hungarian Method 2
Hungarian Method 3
Hungarian Method 4
Djikstra's Algorithm 1
Djikstra's Algorithm 2
Network Simplex Method 1
Network Simplex Method 2
Branch and Bound 1
Branch and Bound 2
Branch and Bound 3
Branch and Bound 4
Branch and Bound 5
Cutting Plane 1
Cutting Plane 2
Dynamic Programming 1
Dynamic Programming 2
Dynamic Programming 3
Dynamic Programming 4
Dynamic Programming 5
Dynamic Programming 6
Dynamic Programming 7
Non-Linear Programming 1
Non-Linear Programming 2
Non-Linear Programming 3
Non-Linear Programming 4
Non-Linear Programming 5
Non-Linear Programming 6
Non-Linear Programming 7
Non-Linear Programming 8
Reviews
1 student review
Only students who have this course can review it.
Öykü Köroğlu
Bought the courseEndüstri Mühendisliği
Buy both together
🎓 92% of Çankaya Üniversitesi students study with the whole bundle.
