IE 343 • Midterm • Mathematical Modeling and Exact Methods
Eğitmen
Kutay Selçuk
Eğitmen
Şu anda Özyeğin Üniversitesi Endüstri Mühendisliği bölümünde eğitimim sürdürmekteyim ve bu yılın sonunda mezun olacağım. Aynı zamanda Data & Analytics alanında çalışırken Endüstri Mühendisliği dersleri vermekteyim.
Paketi Tamamla
🎓 Özyeğin Üniversitesindeöğrencilerin %92'si tüm paketi alarak çalışıyor.
IE 343 • Midterm
Mathematical Modeling and Exact Methods
Kutay Selçuk
1999 TL
IE 343 • Final
Mathematical Modeling and Exact Methods
Kutay Selçuk
1999 TL
Konular
Optimization Overview
Convex Sets
Example 1
Convex Functions
Example 2
Example 3
Example 4
Duality
Example 5
Example 6
IP Problems and Solutions
Complexity Analysis
NP Complete - NP Hard
Example 1
Heuristics Methods
Analyzing Complexity
Example 2
Example 3
Big-O Notation
Example 4
Pseudo Polynomial Time
Example 5
Sample Midterm Problems I
Optimization Overview 1
Optimization Overview 2
Optimization Overview 3
Complexity Analysis 1
Complexity Analysis 2
Complexity Analysis 3
Complexity Analysis 4
Complexity Analysis 5
Complexity Analysis 6
Knapsack Problems and Heuristic Methods - Part I
Introduction
Mathematical Modelling
Example 1
Mathematical Modelling
Example 2
Example 3
Example 4
Knapsack Problems and Heuristic Methods - Part II
Bottom-Up Algorithm
Example 1
Example 2
Bottom-Up Algorithm’s Pseudocode
Example 3
Top-Down Algorithm
Example 4
Example 5
Top-Down Algorithm’s Pseudocode
Sample Midterm Problems II
Knapsack Problems and Heuristic Methods 1
Knapsack Problems and Heuristic Methods 2
Knapsack Problems and Heuristic Methods 3
Knapsack Problems and Heuristic Methods 4
Knapsack Problems and Heuristic Methods 5
Knapsack Problems and Heuristic Methods 6
Knapsack Problems and Heuristic Methods 7
Knapsack Problems and Heuristic Methods 8
Knapsack Problems and Heuristic Methods 9
Knapsack Problems and Heuristic Methods 10
Branch and Bound Method (YENİ)
Branch
Bound
Example 1
Example 2
Example 3
Exam Like Question 1
Exam Like Question 2
Exam Like Question 3
Exam Like Question 4 (IE 342 Çıkmış)
Exam Like Question 5 (IE 342 Çıkmış)
Integer Programming (YENİ)
What is Integer Programming?
Constraints with Binary Variables
Special Constraints
Non-Linear Objectives
Piecewise Linear Example
Absolute Value Example
Max-Min Example
If-then --> Either-or
Example 1
Example 2
Exam Like Question 1
Exam Like Question 2
Exam Like Question 3 (IE 342 Çıkmış)
Exam Like Question 4 (IE 342 Çıkmış)
Exam Like Question 5
Exam Like Question 6
Değerlendirmeler
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.
Ders İçeriği
Optimization Overview
Convex Sets
Example 1
Convex Functions
Example 2
Example 3
Example 4
Duality
Example 5
Example 6
IP Problems and Solutions
Complexity Analysis
NP Complete - NP Hard
Example 1
Heuristics Methods
Analyzing Complexity
Example 2
Example 3
Big-O Notation
Example 4
Pseudo Polynomial Time
Example 5
Sample Midterm Problems I
Optimization Overview 1
Optimization Overview 2
Optimization Overview 3
Complexity Analysis 1
Complexity Analysis 2
Complexity Analysis 3
Complexity Analysis 4
Complexity Analysis 5
Complexity Analysis 6
Knapsack Problems and Heuristic Methods - Part I
Introduction
Mathematical Modelling
Example 1
Mathematical Modelling
Example 2
Example 3
Example 4
Knapsack Problems and Heuristic Methods - Part II
Bottom-Up Algorithm
Example 1
Example 2
Bottom-Up Algorithm’s Pseudocode
Example 3
Top-Down Algorithm
Example 4
Example 5
Top-Down Algorithm’s Pseudocode
Sample Midterm Problems II
Knapsack Problems and Heuristic Methods 1
Knapsack Problems and Heuristic Methods 2
Knapsack Problems and Heuristic Methods 3
Knapsack Problems and Heuristic Methods 4
Knapsack Problems and Heuristic Methods 5
Knapsack Problems and Heuristic Methods 6
Knapsack Problems and Heuristic Methods 7
Knapsack Problems and Heuristic Methods 8
Knapsack Problems and Heuristic Methods 9
Knapsack Problems and Heuristic Methods 10
Branch and Bound Method (YENİ)
Branch
Bound
Example 1
Example 2
Example 3
Exam Like Question 1
Exam Like Question 2
Exam Like Question 3
Exam Like Question 4 (IE 342 Çıkmış)
Exam Like Question 5 (IE 342 Çıkmış)
Integer Programming (YENİ)
What is Integer Programming?
Constraints with Binary Variables
Special Constraints
Non-Linear Objectives
Piecewise Linear Example
Absolute Value Example
Max-Min Example
If-then --> Either-or
Example 1
Example 2
Exam Like Question 1
Exam Like Question 2
Exam Like Question 3 (IE 342 Çıkmış)
Exam Like Question 4 (IE 342 Çıkmış)
Exam Like Question 5
Exam Like Question 6