IE 335 (Fall 23) • Optimization Methods II • Midterm

Linear Programming Modeling 1

Linear Programming Modeling 2

Linear Programming Modeling 3

Linear Programming Modeling 4

Graphical Method 1

Simplex Method 1

Simplex Method 2

Simplex Method 3

Big M Method 1

Big M Method 2

What is duality anyway?

Example 1

Example 2

Example 3

Meaning of Dual Varibles and Complementary Slackness

Example 4

Example 5

Matrices of LP

Example 1

Forming a Table with Given BV

Example 2

Idea Behind Dual Simplex

Comparing Primal/Dual Simplex

Example 1

Example 2

Combining with Primal Simplex

Example 3

Example 4

Example 5

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 Method

Example 1

Example 2

Northwest Corner Method

Example 3

Example 4

Vogel's Method

Example 5

Transportation Simplex Method

Example 1

Example 2

Example 3

Example 4

Definition / LP Solution

Assumptions of the Problem

Hungarian Method

Hungarian Method: Trouble in Paradise

Example 1

Example 2

Duality Theory 1

Duality Theory 2

Duality Theory 3

Duality Theory 4

Dual Simplex 1

Dual Simplex 2

Sensitivity Analysis 1

Sensitivity Analysis 2

Transportation Simplex 1

Transportation Simplex 2

Transportation Simplex 3

Hungarian Method 1

Hungarian Method 2

Hungarian Method 3

Hungarian Method 4