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.
666 TL a month, 3 instalments at no extra cost
Instructor

Ö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.
Topics
Integer Programming Modeling
3 topic lessons
What is Integer Programming?
Constraints with Binary Variables
Special Constraints
Important Question Types
7 topic lessons
Fixed Charge Problems
Example 1
Exam-like Question 1
Assignment Problems
Example 2
Set Covering Problems
Example 3
Tricks for Hardest Questions
7 topic lessons
Non-Linear Objectives
Piecewise Linear Example
Absolute Value Example
Max-Min Example
If-then --> Either-or
Example 1
Example 2
Branch and Bound Method
5 topic lessons
Branch
Bound
Example 1
Example 2
Example 3
Valid Inequalities and Cutting Planes
8 topic lessons
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
5 topic lessons
Knapsack Problem
Cover and Cover Inequality
Example 1
Minimal and Extended Cover
Example 2
🦄🦄 EXAM & QUIZ PRACTICE - PART 1 🦄🦄
22 questions
Integer Programming 1
Integer Programming 2
Integer Programming 3 (FALL 26 SAMPLE MT)
Integer Programming 4 (FALL 26 SAMPLE MT)
Integer Programming 5 (FALL 26 SAMPLE MT)
Integer Programming 6
Branch and Bound Technique 1 (FALL 26 SAMPLE MT)
Branch and Bound Technique 2 (FALL 26 SAMPLE MT)
Branch and Bound Technique 3 (FALL 26 SAMPLE MT)
Branch and Bound Technique 4
Branch and Bound Technique 5
Valid Inequality
Ideal Formulation (FALL 26 SAMPLE MT)
Cutting Plane Algorithm
Cutting Plane Algorithm
Gomory Fractional Cutting Plane
Knapsack Problem
Cover Inequality and Knapsack Problem
Cover Inequality and Knapsack Problem (FALL 26 SAMPLE MT)
Cover Inequality and Knapsack Problem
Cover Inequality and Knapsack Problem
Cover Inequality and Knapsack Problem
Network Models - Shortest Path Problem
7 topic lessons
What is a network?
Shortest Path Problems
Dijkstra's Algorithm
Example 1
Example 2
Example 3
Example 4
🦄🦄 EXAM & QUIZ PRACTICE - PART 2 🦄🦄
6 questions
Shortest Path Problem
Shortest Path Problem
Shortest Path Problem
Shortest Path Problem
Shortest Path Problem
Shortest Path Problem
FALL 26 Midterm Practice Set Solutions
9 questions
Integer Programming (FALL 26 SAMPLE MT)
Integer Programming 1 (FALL 26 SAMPLE MT)
Integer Programming 2 (FALL 26 SAMPLE MT)
Integer Programming 3 (FALL 26 SAMPLE MT)
Branch and Bound Technique 1 (FALL 26 SAMPLE MT)
Branch and Bound Technique 2 (FALL 26 SAMPLE MT)
Branch and Bound Technique 3 (FALL 26 SAMPLE MT)
Ideal Formulation (FALL 26 SAMPLE MT)
Cover Inequality and Knapsack Problem (FALL 26 SAMPLE MT)
Reviews
22 student reviews
Only students who have this course can review it.
Uğur Karabaş
Bought the courseEndüstri Mühendisliği
10 numara
Göktuğ Yılmaz Kösek
Bought the courseEndüstri Mühendisliği
Alp Demir Akın
Bought the courseEndüstri Mühendisliği
Kerem İlker Ayvacı
Bought the courseEndüstri Mühendisliği
Betül Araz
Bought the courseEndüstri Mühendisliği
Arzuv Orazmyradova
Bought the courseEndüstri Mühendisliği
Ozan Arıöz
Bought the courseEndüstri Mühendisliği
Aslı Erkan
Bought the courseEndüstri Mühendisliği
Yiğit Duha Toraman
Bought the courseEndüstri Mühendisliği
Yiğit Duha Toraman
Bought the courseEndüstri Mühendisliği
Buy both together
🎓 92% of Bilkent Üniversitesi students study with the whole bundle.
