IE 303 • Midterm • Modeling and Methods in Optimization
Integer Programming ve türevlerine dair oldukça ayrıntılı konu anlatımları ve çözümlü örneklerle hazırlanmış bu dersle birlikte IE 303 gibi zor bir dersi bile kolay hale getir.
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.
Paketi Tamamla
🎓 Bilkent Üniversitesinde öğrencilerin %92'si tüm paketi alarak çalışıyor.
IE 303 • Midterm
Modeling and Methods in Optimization
Ömer Faruk Altun
1799 TL
IE 303 • Final
Modeling and Methods in Optimization
Ömer Faruk Altun
1799 TL
Konular
Integer Programming Modeling
What is Integer Programming?
Constraints with Binary Variables
Special Constraints
Important Question Types
Fixed Charge Problems
Example 1
Exam Like Question 1
Assignment Problems
Example 2
Set Covering Problems
Example 3
Tricks for Hardest Questions
Non-Linear Objectives
Piecewise Linear Example
Absolute Value Example
Max-Min Example
If-then --> Either-or
Example 1
Example 2
Branch and Bound Algorithm
Introduction
Example 1
Example 2
An Important Question
Knapsack Problem and Branch&Bound
Knapsack Problemi B&B Example
Complete (Implicit) Enumeration
Method
Example 1
Example 2
Example 3
Valid Inequalities and Cutting Planes
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
Cover and Knapsack Problem
Definition
Cover and Cover Inequality
Example 1
Minimal and Extended Cover
Example 2
🦄 🦄 QUIZ 1 PRACTICE PROBLEMS 🦄 🦄
Integer Programming
Integer Programming
Integer Programming
Integer Programming
Integer Programming
Branch and Bound Technique
Branch and Bound Technique
Branch and Bound Technique
Valid Inequality
Ideal Formulation
Gomory Fractional Cutting Plane
Cutting Plane Algorithm
Cover Inequality and Knapsack Problem
Cover Inequality and Knapsack Problem
Network Models - Shortest Path Problem
What is a network?
Shortest Path Problems
Dijkstra's Algorithm
Example 1
Example 2
Example 3
Example 4
Example 5
Network Models - Maximum Flow Problem
Maximum Flow Problems
Minimum Cut
Ford Fulkerson Algorithm
Example 1
Example 2
🦄 🦄 QUIZ 2 PRACTICE PROBLEMS 🦄 🦄
Shortest Path Problem 1
Shortest Path Problem 3
Shortest Path Problem 4
Maximum Flow Problem 1
Maximum Flow Problem 2
Sample Midterm Problems
Integer Programming 1
Integer Programming 2
Integer Programming 3
Integer Programming 4
Integer Programming 5
Integer Programming 6
Integer Programming 7
Integer Programming 8
Integer Programming 9
Integer Programming 10
Integer Programming 11
Implicit Enumeration 1
Implicit Enumeration 2
Implicit Enumeration 3
Branch and Bound 1
Branch and Bound 2
Branch and Bound 3
Cutting Plane Algorithm
Cover Inequality and Knapsack Problem 2
Cover Inequality and Knapsack Problem 3
Cover Inequality and Knapsack Problem 5
Cover Inequality and Knapsack Problem 6
Shortest Path Problem
Shortest Path Problem
Maximum Flow Problem
Maximum Flow Problem
Değerlendirmeler
Ders İçeriği
Integer Programming Modeling
What is Integer Programming?
Constraints with Binary Variables
Special Constraints
Important Question Types
Fixed Charge Problems
Example 1
Exam Like Question 1
Assignment Problems
Example 2
Set Covering Problems
Example 3
Tricks for Hardest Questions
Non-Linear Objectives
Piecewise Linear Example
Absolute Value Example
Max-Min Example
If-then --> Either-or
Example 1
Example 2
Branch and Bound Algorithm
Introduction
Example 1
Example 2
An Important Question
Knapsack Problem and Branch&Bound
Knapsack Problemi B&B Example
Complete (Implicit) Enumeration
Method
Example 1
Example 2
Example 3
Valid Inequalities and Cutting Planes
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
Cover and Knapsack Problem
Definition
Cover and Cover Inequality
Example 1
Minimal and Extended Cover
Example 2
🦄 🦄 QUIZ 1 PRACTICE PROBLEMS 🦄 🦄
Integer Programming
Integer Programming
Integer Programming
Integer Programming
Integer Programming
Branch and Bound Technique
Branch and Bound Technique
Branch and Bound Technique
Valid Inequality
Ideal Formulation
Gomory Fractional Cutting Plane
Cutting Plane Algorithm
Cover Inequality and Knapsack Problem
Cover Inequality and Knapsack Problem
Network Models - Shortest Path Problem
What is a network?
Shortest Path Problems
Dijkstra's Algorithm
Example 1
Example 2
Example 3
Example 4
Example 5
Network Models - Maximum Flow Problem
Maximum Flow Problems
Minimum Cut
Ford Fulkerson Algorithm
Example 1
Example 2
🦄 🦄 QUIZ 2 PRACTICE PROBLEMS 🦄 🦄
Shortest Path Problem 1
Shortest Path Problem 3
Shortest Path Problem 4
Maximum Flow Problem 1
Maximum Flow Problem 2
Sample Midterm Problems
Integer Programming 1
Integer Programming 2
Integer Programming 3
Integer Programming 4
Integer Programming 5
Integer Programming 6
Integer Programming 7
Integer Programming 8
Integer Programming 9
Integer Programming 10
Integer Programming 11
Implicit Enumeration 1
Implicit Enumeration 2
Implicit Enumeration 3
Branch and Bound 1
Branch and Bound 2
Branch and Bound 3
Cutting Plane Algorithm
Cover Inequality and Knapsack Problem 2
Cover Inequality and Knapsack Problem 3
Cover Inequality and Knapsack Problem 5
Cover Inequality and Knapsack Problem 6
Shortest Path Problem
Shortest Path Problem
Maximum Flow Problem
Maximum Flow Problem
Sı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.