END 331E • Midterm II + Final • Operations Research I

Matrices of LP

Example 1

Forming a Table with Given BV

Example 2

Simplex Method in Matrix Form

Example 3

Revised Simplex

Example 4

Idea Behind Dual Simplex

Comparing Primal/Dual Simplex

Example 1

Example 2

Combining with Primal Simplex

Example 3

General Procedure

Changing Coefficients of a Non-Basic Variable

Example 1

Example 2

Introducing a New Variable

Example 3

Example 4

Changing Right-Hand-Side of a Constraint

Example 5

Example 6

Introducing a New Constraint

Example 7

Example 8

Changing Coefficients of a Basic Variable

Example 9

Example 10

Definition / LP Solution

Assumptions of the Problem

Least Cost Solution

Example 1

Northwest Corner Solution

Example 2

Vogel's Method

Example 3

Transportation Simplex Method

Example 4

Example 5

Example 6

Definition / LP Solution

Assumptions of the Problem

Hungarian Method

Hungarian Method: Trouble in Paradise

Example 1

Example 2

Exam Like Question 1

What is a network?

Shortest Path Problems

Dijkstra's Algorithm

Example 1

Example 2

Example 3

Example 4

Example 5

Matrix Form 1

Matrix Form 2

Revised Simplex 1

Revised Simplex 2

Dual Simplex Method 1

Dual Simplex Method 2

Dual Simplex Method 3

Dual Simplex Method 4

Dual Simplex Method 5

Transportation Problem 1

Transportation Problem 2

Assignment Problem 1

Assignment Problem 2

Assignment Problem 3

Network Models: Shortest Path Problem 1

Network Models: Shortest Path Problem 2

Network Models: Shortest Path Problem 3

Network Models: Shortest Path Problem 4

Network Models: Shortest Path Problem 5