IE 331 • MidtermMathematical Modeling and Optimization II

Endüstri Mühendisliği'nin belki de en zor konularını bir arada barındıran bu dersten korkmana gerek yok.

Detaylı konu anlatımları ve çok sayıda çözümlü örnekle Unicourse yine yanında!

1799 TL

599 TL a month, 3 instalments at no extra cost

32 past exam questions with solutions
52 topic lessons · 12 hours
5.0 rating
Access for the whole term

Instructor

Ömer Faruk Altun

Ö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

Course introduction

What is a network?

Free

Shortest Path Problems

Dijkstra's Algorithm

Free

Example 1

Example 2

Free

Example 3

Maximum Flow Problems

Minimum Cut

Ford Fulkerson Algorithm

Example 1

Example 2

What is it?

LP Solution

Assignment Problem

Example 1

Shortest Path Problem

Example 2

Maximum Flow Problem

Example 3

What is a Minimum Spanning Tree?

Prim's Algorithm

Example 1

Example 2

What is Integer Programming?

Constraints with Binary Variables

Special Constraints

Fixed Charge Problems

Example 1

Exam-like Question 1

Assignment Problems

Example 2

Set Covering Problems

Example 3

Non-Linear Objectives

Piecewise Linear Example

Absolute Value Example

Max-Min Example

If-then --> Either-or

Example 1

Example 2

Problem Definition

MTZ Subtour Elimination

DFJ Subtour Elimination

Example

Branch

Bound

Example 1

Example 2

Example 3

What is Knapsack Problem?

B & B Solution of Knapsack Problem

Example 4

Shortest Path Problem

Minimum Spanning Tree

Integer Programming

Free

Branch and Bound

MCNFP

Free

Integer Programming

Integer Programming

Branch and Bound

Maximum Flow Problem

Minimum Spanning Tree

Integer Programming

Integer Programming

Shortest Path Problem

Maximum Flow Problem

Integer Programming

Branch and Bound

Shortest Path Problem

MCNFP

Integer Programming

Branch and Bound

Maximum Flow Problem

Integer Programming

Integer Programming

Branch and Bound

Maximum Flow Problem

Integer Programming

Integer Programming

Branch and Bound

Shortest Path Problem

Minimum Spanning Tree

MCNFP

Integer Programming

Reviews

5

1 student review

Only students who have this course can review it.

Pamir Sarıduman

Bought the course

Endüstri Mühendisliği

8 days ago

Buy both together

🎓 92% of TED Üniversitesi students study with the whole bundle.

Mathematical Modeling and Optimization II

IE 331 • Midterm

Mathematical Modeling and Optimization II

5.0(1)
1499 TL1799 TL17%
Mathematical Modeling and Optimization II

IE 331 • Final

Mathematical Modeling and Optimization II

5.0(1)
1499 TL1799 TL17%
599 TL off
Total:3598 TL2999 TL

Frequently asked questions about IE 331 Midterm

Frequently asked questions about Unicourse

1799 TL