IE 252 • Midterm • Optimization II

Definition / LP Solution

Assumptions of the Problem

Least Cost Method

Example 1

Example 2

Northwest Corner Method

Example 3

Example 4

Vogel's Method

Example 5

Transportation Simplex Method

Example 6

Example 7

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

Example 1

Example 2

Maximum Flow Problems

Minimum Cut

Ford Fulkerson Algorithm

Example 1

Example 2

What is a Minimum Spanning Tree?

Prim's Algorithm

Example 1

Example 2

Boss of Network Problems

Example

Step 1: Finding Initial BFS

Step 2: Finding Entering Variable

Step 3: Finding Leaving Variable & Pivoting

Let's Continue with Iterations

Transportation Problem 1

Transportation Problem 2

Transportation Problem 3

Transportation Problem 4

Transshipment Problem 1

Assignment Problem 1

Assignment Problem 2

Assignment Problem 3

Assignment Problem 4

Assignment Problem 5

Shortest Path Problem 1

Shortest Path Problem 2

Shortest Path Problem 3

Maximum Flow Problem 1

Maximum Flow Problem 2

Maximum Flow Problem 3

Minimum Spanning Tree 1

Minimum Spanning Tree 2

Minimum Cost Network Flow Problem

Network Simplex Method