# INDR 363 (Fall 23) • Mathematical Programming • Midterm

Siz istediniz, biz hazırladık! INDR 262 dersinin devamı niteliğinde olan INDR 363 sizlerle ! Derste bulunan her konudan geçmiş senelerde çözülen örnekler ve çıkmış sorular baz alınarak hazırlanmış 20 saatin üzerinde içeriğiyle bu dersimizle sınava en hazır şekilde girin.

Dersin içeriğinde bulunan 1) Transportation Problem & Transportation Simplex 2) Assignment Problem & Hungarian Method 3) Transshipment Problem 4) Shortest Path Problem & Dijkstra's Algorithm 5) Minimum Spanning Tree 6) Maximum Flow Problem & Flow Augmenting Path Algorithm 7) Minimum Cost Network Flow Problem & Network Simplex Algorithm 8) Deterministic & Stochastic Dynamic Programming konuları ile hem sınava hazırlanın hem de Quiz ve ödevlerinizde rahat edin!

Ders Tanıtımı

Definition / LP Solution

Ücretsiz

Assumptions of the Problem

Least Cost Method

Example 1

Example 2

Northwest Corner Method

Example 3

Example 4

Vogel's Method

Example 5

Ücretsiz

Transportation Simplex Method

Example 1

Example 2

Exam Like Question 1

Definition / LP Solution

Assumptions of the Problem

Hungarian Method

Example 1

Example 2

Exam Like Question 1

Transshipment Problem Definition/LP Solution

Example 1

Exam Like Question 1

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

Ücretsiz

Shortest Path Problem Example 2

Shortest Path Problem Exam Like Question 1

Ücretsiz

Shortest Path Problems True/False Exam Like Question 1

Ücretsiz

Shortest Path Problems True/False Exam Like Question 2

What is a Minimum Spanning Tree?

Prim's Algorithm

Example 1

Example 2

Exam Like Question 1

True/False Exam Like Question

Maximum Flow Problems

Minimum Cut

Ford Fulkerson Method (Flow Augmenting Path Algorithm)

Example 1

Example 2

Ücretsiz

Exam Like Question 1

Ücretsiz

Boss of Network Problems

MCNFP Example 1

MCNFP Exam Like Question 1

MCNFP Exam Like Question 2

Step 1: Finding Initial BFS

Step 2: Finding Entering Variable

Step 3: Finding Leaving Variable & Pivoting

Let's Continue with Iterations

Exam Like Question 1

Ücretsiz

A New Approach to Optimization Problems

Inventory Problems

Inventory Problems Example 1

Inventory Problems Exam Like Question 1

Inventory Problems Exam Like Question 2

Resource Allocation Problems

Resource Allocation Problems Example 1

Resource Allocation Problems Exam Like Question 1

Resource Allocation Problems Exam Like Question 2

Knapsack Problem Exam Like Question 1

Non-Linear Programming DP Solution Integer Case

Non-Linear Programming DP Solution Continuous Case

NLP Integer Case Exam Like Question

NLP Continuous Exam Like Question

What is the difference?

Example 1

Example 2

Example 3

Exam Like Question 1

Exam Like Question 2

Ücretsiz

Transportation Simplex 1

Transportation Simplex 2

Transportation Simplex 3

Ücretsiz

Transportation Simplex 4

Ücretsiz

Assignment Problem 1

Ücretsiz

Assignment Problem 2

Assignment Problem 3

Ücretsiz

Shortest Path Problem 1

Ücretsiz

Shortest Path Problem 2

Shortest Path Problem 3

Minimum Spanning Tree 1

Ücretsiz

Maximum Flow Problem 1

Maximum Flow Problem 2

Dynamic Programming 1

Dynamic Programming 2

Dynamic Programming 3

Dynamic Programming 4

Dynamic Programming 5

Dynamic Programming 6

## Eğitmen

Ömer Faruk Altun
MSCS

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. Şu anda UALR'da Information Science doktora eğitimimi sürdürüyorum. 7 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.

₺999.99
Hemen Al