IE 333 • FinalOperations Research II - Deterministic Problems

Tamamen yöntemlere dayalı bu derste de birinci kaynağın Unicourse!

Her metodu derinlemesine işlediğimiz ve çözümlü örneklerle son noktayı koyduğumuz bu dersle IE 333 çok kolay!

1799 TL

599 TL a month, 3 instalments at no extra cost

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

Pass guarantee

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.

Pass guarantee

We trust our courses. If you prepare for your exams with us and still fail the course, you can get a refund. Terms

Topics

Course introduction

Definition / LP Solution

Free

Assumptions of the Problem

Free

Least Cost Method

Least Cost Method Example 1

Least Cost Method Example 2

Northwest Corner Method

Northwest Corner Method Example 1

Northwest Corner Method Example 2

Vogel's Method

Vogel's Method Example 1

Transportation Simplex Method

Example 1

Example 2

Example 3

Definition / LP Solution

Assumptions of the Problem

Hungarian Method

Hungarian Method: Trouble in Paradise

Example 1

Example 2

What is a network?

Shortest Path Problems

Dijkstra's Algorithm

Djikstra's Algorithm Example 1

Djikstra's Algorithm Example 2

Shortest Path Problem Example 1

Shortest Path Problem Example 2

Shortest Path Problem Example 3

General Procedure

Initial BFS

Iterations

Example

Introduction

Example 1

Example 2

An Important Question

Knapsack Problem and Branch&Bound

Knapsack Problemi B&B Example

Method

Example 1

Example 2

A New Approach to Optimization Problems

Inventory Problems

Inventory Problems Example 1

Resource Allocation Problems

Resource Allocation Problems Example 1

What is NLP?

One Variable Unconstrained Optimization

Convexity in Detail

Multivariable Unconstrained Optimization

Convexity in Detail

KKT Conditions

Example

Transportation Simplex Method 1

Transportation Simplex Method 2

Free

Hungarian Method 1

Hungarian Method 2

Free

Hungarian Method 3

Hungarian Method 4

Free

Djikstra's Algorithm 1

Djikstra's Algorithm 2

Free

Network Simplex Method 1

Network Simplex Method 2

Branch and Bound 1

Free

Branch and Bound 2

Branch and Bound 3

Free

Branch and Bound 4

Branch and Bound 5

Free

Cutting Plane 1

Cutting Plane 2

Free

Dynamic Programming 1

Free

Dynamic Programming 2

Dynamic Programming 3

Free

Dynamic Programming 4

Free

Dynamic Programming 5

Dynamic Programming 6

Dynamic Programming 7

Free

Non-Linear Programming 1

Free

Non-Linear Programming 2

Non-Linear Programming 3

Free

Non-Linear Programming 4

Non-Linear Programming 5

Non-Linear Programming 6

Free

Non-Linear Programming 7

Non-Linear Programming 8

Free

Reviews

5

1 student review

Only students who have this course can review it.

Öykü Köroğlu

Bought the course

Endüstri Mühendisliği

7 days ago

Buy both together

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

Operations Research II - Deterministic Problems

IE 333 • Midterm

Operations Research II - Deterministic Problems

5.0(1)
1499 TL1799 TL17%
Operations Research II - Deterministic Problems

IE 333 • Final

Operations Research II - Deterministic Problems

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

Frequently asked questions about IE 333 Final

Frequently asked questions about Unicourse

Pass guarantee

1799 TL