INDR 262 • Final • Operations Research I

Dual of an LP

Examples 1-2

Example 3

Weak Duality Theorem

Strong Duality Theorem

Shadow Price

Magic of Linear Algebra

Matrices of LP

Forming a Table

Example 1

One Formula to Rule Them All

Example 2

Dual Solution

Primal/Dual Feasibility and Optimality

Example 3

Idea Behind Dual Simplex

Comparing Primal/Dual Simplex

Example 1

Example 2

Combining with Primal Simplex

Example 3

Example 4

Example 5

General Procedure

Optimal Basis v Optimal Solution

Changes in Objective Function - NBV

Example

Changes in Objective Function - BV

Example

Changes in the RHS

Example

Adding a New Variable

Example

Adding a New Constraint

Example

Duality 1

Duality 2

Duality 3

Duality 4

Duality 5

Duality 6

Simplex Tableau Layout 1

Simplex Tableau Layout 2

Simplex Tableau Layout 3

Dual Simplex Method 1

Dual Simplex Method 2

Dual Simplex Method 3

Dual Simplex Method 4

Dual Simplex Method 5

Post-Optimality Analysis 1

Post-Optimality Analysis 2

Post-Optimality Analysis 3

Post-Optimality Analysis 4

Post-Optimality Analysis 5

What is Integer Programming?

Fixed Cost Problems

Example 1

Constraints with Binary Variables

Special Constraints

Assignment Problems

Example 2

Set Covering Problems

Example 3

Example 4

Example 5

Example 6

Example 7

Definition / LP Solution

Assumptions of the Problem

Least Cost Solution

Example 1

Northwest Corner Solution

Example 2

Transportation Simplex Method

Example 3

Example 4

Example 5

Definition / LP Solution

Assumptions of the Problem

Hungarian Method

Hungarian Method: Trouble in Paradise

Example 1

Example 2