INE 3009 • Midterm • Operations Research II

Introduction

Preemptive Goal Programming

Solving GP Problems

Example 1

Example 2

Definition / LP Solution

Assumptions of the Problem

Least Cost Method

Example 1

Example 2

Northwest Corner Method

Example 3

Example 4

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 Minimal Spanning Tree?

Prim's Algorithm

Example 1

Example 2

What is a network?

Shortest Route Problems

Dijkstra's Algorithm

Example 1

Example 2

Example 3

Example 4

Example 5

Maximum Flow Problems

Minimum Cut

Flow Augmenting Path Algorithm

Example 1

Example 2

What is it?

LP Solution

Assignment Problem

Example 1

Shortest Path Problem

Example 2

Maximum Flow Problem

Example 3

Goal Programming 1

Goal Programming 2

Goal Programming 3

Goal Programming 4 (NEW)

Transportation Problem 1

Transportation Problem 2

Transportation Problem 3 (NEW)

Assignment Problem 1

Assignment Problem 2

Assignment Problem 3

Assignment Problem 4 (NEW)

Assignment Problem 5 (NEW)

Minimum Spanning Tree 1

Minimum Spanning Tree 2

Minimum Spanning Tree 3

Minimum Spanning Tree 4 (NEW)

Shortest Route Problems 1

Shortest Route Problems 2

Shortest Route Problems 3

Shortest Route Problems 4

Shortest Route Problems 5

Shortest Route Problems 6

Shortest Route Problems 7 (NEW)

Maximum Flow Problems 1

Maximum Flow Problems 2

Maximum Flow Problems 3

Network Representation 1 (NEW)

Network Representation 2 (NEW)