IE 343 • Tüm Sınavlar • Mathematical Modeling and Exact Methods
Özyeğin Üniversitesi IE 343 (Mathematical Modeling and Exact Methods) Midterm sınavına hazırlık paketi.
İşlenen konular: Optimization Overview, Complexity Analysis, Knapsack Problems and Heuristic Methods - Part I, Knapsack Problems and Heuristic Methods - Part II, Branch and Bound Method, Integer Programming.
Ayda 1332 TL, peşin fiyatına 3 taksit
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.
Konular
Optimization Overview
10 konu anlatımı
Convex Sets
Example 1
Convex Functions
Example 2
Example 3
Example 4
Duality
Example 5
Example 6
IP Problems and Solutions
Complexity Analysis
10 konu anlatımı
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
9 soru
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
7 konu anlatımı
Introduction
Mathematical Modelling
Example 1
Mathematical Modelling
Example 2
Example 3
Example 4
Knapsack Problems and Heuristic Methods - Part II
9 konu anlatımı
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
10 soru
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İ)
5 konu anlatımı · 5 soru
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İ)
10 konu anlatımı · 6 soru
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
Shortest Path Problem
12 konu anlatımı
Introduction
Mathematical Modelling
Example 1
Example 2
Dijkstra’s Algorithm
Example 3
Example 4
Dijkstra’s Algorithm’s Pseudocode
Bellman-Ford Algorithm
Example 5
Example 6
Bellman-Ford Algorithm’s Pseudocode
Sample Final Problems I
10 soru
Shortest Path Problem 1
Shortest Path Problem 2
Shortest Path Problem 3
Shortest Path Problem 4
Shortest Path Problem 5
Shortest Path Problem 6
Shortest Path Problem 7
Shortest Path Problem 8
Shortest Path Problem 9
Shortest Path Problem 10
Facility Location Problems
16 konu anlatımı
Introduction
p-Median
p-Median Mathematical Modelling
Example 1
p-Median Greedy Algorithm
Example 2
p-Center
p-Center Mathematical Modelling
Example 3
p-Center Greedy Algorithm
Example 4
p-Hub Median
p-Hub Median Mathematical Modelling
Linearization
Example 5
Example 6
Sample Final Problems II
10 soru
Facility Location Problems 1
Facility Location Problems 2
Facility Location Problems 3
Facility Location Problems 4
Facility Location Problems 5
Facility Location Problems 6
Facility Location Problems 7
Facility Location Problems 8
Facility Location Problems 9
Facility Location Problems 10
Travelling Salesman Problem
18 konu anlatımı
Introduction
Mathematical Modelling
Example 1
Miller-Tucker-Zemlin
Example 2
Example 3
Dantzig-Fulkerson-Johnson
Example 4
Example 5
Nearest Neighbor Algorithm
Nearest Neighbor Algorithm’s Pseudocode
Iterative NN
Randomized NN
Example 6
1-Opt Move
Example 7
2-Opt Move
Example 8
Sample Final Problems III
11 soru
Travelling Salesman Problem 1
Travelling Salesman Problem 2
Travelling Salesman Problem 3
Travelling Salesman Problem 4
Travelling Salesman Problem 5
Travelling Salesman Problem 6
Travelling Salesman Problem 7
Travelling Salesman Problem 8
Travelling Salesman Problem 9
Travelling Salesman Problem 10
Travelling Salesman Problem 11