IE 203 • Midterm • Operations Research II
Non-Linear Programming'den Markov Chain'e ileri seviye optimizasyon problemlerini çözmek hiç bu kadar kolay olmamıştı!
Eğitmen
Ö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.
Geçme Garantisi
Derslerimize çok güveniyoruz. Dersi geçememen çok zor ama yine de geçemezsen paran iade.
Tüm koşullarPaketi Tamamla
🎓 Boğaziçi Üniversitesinde öğrencilerin %92'si tüm paketi alarak çalışıyor.
IE 203 • Midterm
Operations Research II
Ömer Faruk Altun
1299 TL
IE 203 • Final
Operations Research II
Ömer Faruk Altun
1299 TL
Konular
Integer Programming Modeling
What is Integer Programming?
Fixed Cost Problems
Example 1
Example 2
Constraints with Binary Variables
Special Constraints
If-then --> Either-or
Example 3
Example 4
Assignment Problems
Example 5
Set Covering Problems
Example 6
Tricks for Hardest Questions
Non-Linear Objectives
Piecewise Linear Example
Absolute Value Example
Max-Min Example
Using Closed Form
Example 1
Example 2
Example 3
Branch and Bound Method
Branch
Bound
Example 1
Example 2
Example 3
What is Knapsack Problem?
B & B Solution of Knapsack Problem
Example 4
Valid Inequalities and Cutting Plane Method
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
Quiz I Çalışma Soruları
Integer Programming
Integer Programming
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
Valid Inequalities and Cutting Plane
Valid Inequalities and Cutting Plane
Valid Inequalities and Cutting Plane
Valid Inequalities and Cutting Plane
Valid Inequalities and Cutting Plane
Non-Linear Optimization in One Variable & Convexity
What is NLP?
One Variable Unconstrained Optimization
Convexity
Bisection method
Example 1
Example 2
Newton's method
Example 3
Example 4
Non-Linear Unconstrained Optimization & Convexity
Multivariable Unconstrained Optimization
Convexity
Gradient Search Algorithm
Example 1
Constrained Non-Linear Optimization
KKT Conditions
Example 1
Deterministic Dynamic Programming
A New Approach to Optimization Problems
Inventory Problems
Example 1
Example 2
Resource Allocation Problems
Example 3
Example 4
Example 5
Solving NLPs with Dynamic Programming (Integer Variables)
Solving NLPs with Dynamic Programming (Continuous Variables)
Sample Midterm Problems
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
Valid Inequalities and Cutting Plane
Valid Inequalities and Cutting Plane
Valid Inequalities and Cutting Plane
NLP Formulation
NLP Formulation
Convexity
Convexity
Convexity
One-Dimensional Minimization
One-Dimensional Minimization
Unconstrained Optimization
Unconstrained Optimization
Unconstrained Optimization
Constrained Optimization
Constrained Optimization
Constrained Optimization
Constrained Optimization
Constrained Optimization
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Değerlendirmeler
Hocamıza teşekkür ediyorum geri bildirimlere göre eksik bir şey kalmamasına önem veriyor. Öneririm herkese.
Ders İçeriği
Integer Programming Modeling
What is Integer Programming?
Fixed Cost Problems
Example 1
Example 2
Constraints with Binary Variables
Special Constraints
If-then --> Either-or
Example 3
Example 4
Assignment Problems
Example 5
Set Covering Problems
Example 6
Tricks for Hardest Questions
Non-Linear Objectives
Piecewise Linear Example
Absolute Value Example
Max-Min Example
Using Closed Form
Example 1
Example 2
Example 3
Branch and Bound Method
Branch
Bound
Example 1
Example 2
Example 3
What is Knapsack Problem?
B & B Solution of Knapsack Problem
Example 4
Valid Inequalities and Cutting Plane Method
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
Quiz I Çalışma Soruları
Integer Programming
Integer Programming
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
Valid Inequalities and Cutting Plane
Valid Inequalities and Cutting Plane
Valid Inequalities and Cutting Plane
Valid Inequalities and Cutting Plane
Valid Inequalities and Cutting Plane
Non-Linear Optimization in One Variable & Convexity
What is NLP?
One Variable Unconstrained Optimization
Convexity
Bisection method
Example 1
Example 2
Newton's method
Example 3
Example 4
Non-Linear Unconstrained Optimization & Convexity
Multivariable Unconstrained Optimization
Convexity
Gradient Search Algorithm
Example 1
Constrained Non-Linear Optimization
KKT Conditions
Example 1
Deterministic Dynamic Programming
A New Approach to Optimization Problems
Inventory Problems
Example 1
Example 2
Resource Allocation Problems
Example 3
Example 4
Example 5
Solving NLPs with Dynamic Programming (Integer Variables)
Solving NLPs with Dynamic Programming (Continuous Variables)
Sample Midterm Problems
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
Valid Inequalities and Cutting Plane
Valid Inequalities and Cutting Plane
Valid Inequalities and Cutting Plane
NLP Formulation
NLP Formulation
Convexity
Convexity
Convexity
One-Dimensional Minimization
One-Dimensional Minimization
Unconstrained Optimization
Unconstrained Optimization
Unconstrained Optimization
Constrained Optimization
Constrained Optimization
Constrained Optimization
Constrained Optimization
Constrained Optimization
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Geçme Garantisi
Derslerimize çok güveniyoruz. Dersi geçememen çok zor ama yine de geçemezsen paran iade.
Tüm koşullarSıkça Sorulan Sorular
Örneğin, Koç Üniversitesi - MATH 101 (Calculus) veya başka bir okulun benzer dersi olsun, paketlerimiz tam da o derse göre tasarlanır. Böylece nokta atışı çalışır, zaman kazanırsın.
Sınava özel videolar —konu anlatımları, çıkmış sorular ve çözümleri, özet notlar—içerir. Sınavda sıkça çıkan soruları hedefler. Eğitmenlerimiz, üniversitenin akademik takvimini takip ederek paketleri sürekli günceller. Böylece, gereksiz detaylarla vakit kaybetmeden başarını artırmaya odaklanabilirsin.