IE 232 • Final • Operations Research I - Modeling

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

Transshipment Problem Definition/LP Solution

Example 8

Definition / LP Solution

Assumptions of the Problem

Hungarian Method

Hungarian Method: Trouble in Paradise

Hungarian Method Example 1

Hungarian Method 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

Problem Definition

Solving Problem

Enumeration

Example 1

Nearest Neighbor Algorithm

Example 2

Example 3

Example 4

Example 5

Savings Matrix

Savings Heuristic

Example 1

Example 2

Two-Opt Swap

Important Note on Two-Opt Swaps

Two-Opt Heuristic

Example 3

Example 4

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

Ford Fulkerson Algorithm 1

Maximum Flow Problem 1

Maximum Flow Problem 2

Minimum Spanning Tree 1

Minimum Spanning Tree 2

Travelling Salesman Problem 1

Travelling Salesman Problem 2

Travelling Salesman Problem 3

Travelling Salesman Problem 4