IE 333 • Operations Research II - Deterministic Problems • Final
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!
Konular
Transportation Problem and Initial Solutions
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
Transportation Simplex Method
Transportation Simplex Method Example 1
Transportation Simplex Method Example 2
Transportation Simplex Method Example 3
Transportation Simplex Method Example 4
Assignment Problem and Hungarian Method
Definition / LP Solution
Assumptions of the Problem
Hungarian Method
Hungarian Method: Trouble in Paradise
Hungarian Method Example 1
Hungarian Method Example 2
Network Models: Shortest Path Problems
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
Shortest Path Problems Exam Like Question 3
Network Models: Network Simplex Method
Step 1: Finding Initial BFS
Step 2: Finding Entering Variable
Step 3: Finding Leaving Variable & Pivoting
Let's Continue with Iterations
Branch and Bound Method
Introduction
Example 1
Example 2
An Important Question
Knapsack Problem and Branch&Bound
Knapsack Problemi B&B Example
Cutting Plane Algortihm
Method
Example 1
Example 2
Dynamic Programming
A New Approach to Optimization Problems
Inventory Problems
Inventory Problems Example 1
Resource Allocation Problems
Resource Allocation Problems Example 1
Non-Linear Programming (NLP)
What is NLP?
One Variable Unconstrained Optimization
Bisection method
Bisection Method Example 1
Bisection Method Example 2
Newton's method
Newton's Method Example 1
Newton's Method Example 2
Multivariable Unconstrained Optimization
Gradient Search Algorithm
Example 5
KKT Conditions
Example 6
Sample Final Questions
Transportation Simplex 1
Transportation Simplex 2
Hungarian Method 1
Hungarian Method 2
Djikstra's Algorithm 1
Djikstra's Algorithm 2
Network Simplex Method
Branch and Bound 1
Branch and Bound 2
Branch and Bound 3
Cutting Plane 1
Cutting Plane 2
Dynamic Programming 1
Dynamic Programming 2
Dynamic Programming 3
Dynamic Programming 4
Dynamic Programming 5
NLP 1
NLP 2
NLP 3
NLP 4
Eğitmen
Ömer Faruk AltunCo-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. 11 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.
999 TL
Bu ders ile kazanacakların:
- Okuluna özel hazırlanmış dersler
- Çıkmış sorular ve çözümleri
- Örnek sınav soruları
- İstediğin yerden erişim
- Tekrar tekrar izleme
- Kendi hızında öğrenme
Sıkça birlikte alınan dersler
Toplam:1998 TL