END 331E • Operations Research I • Midterm II

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

Dual Simplex 1

Dual Simplex 2

Sensitivity Analysis and Post-Optimality 1

Sensitivity Analysis and Post-Optimality 2

Transportation Models 1

Transportation Models 2

Transportation Models 3

Assignment Models 1

Assignment Models 2

Assignment Models 3

Shortest Path Problems 1

Shortest Path Problems 2