IE 3033 • Midterm III + Final • Operations Research I

What is duality anyway?

Example 1

Example 2

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

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

Introduction

Preemptive Goal Programming

Solving GP Problems

Example 1

Example 2

What is a network?

Shortest Path Problems

Dijkstra's Algorithm

Example 1

Example 2

Example 3

Example 4

Example 5

Maximum Flow Problems

Minimum Cut

Ford Fulkerson Algorithm

Example 1

Example 2

Boss of Network Problems

Example 1

Exam Like Question 1

What is a Minimum Spanning Tree?

Prim's Algorithm

Example 1

Example 2

Duality 1

Duality 2

Duality 3

Duality 4

Duality 5

Dual Simplex 1

Dual Simplex 2

Dual Simplex 3

Sensitivity Analysis 1

Sensitivity Analysis 2

Goal Programming 1

Goal Programming 2

Goal Programming 3

Shortest Route Problem 1

Shortest Route Problem 2

Maximal Flow Problem 1

Maximal Flow Problem 2

Minimum Cost Network Flow Problem 1

Minimum Spanning Tree Algorithm 1

Minimum Spanning Tree Algorithm 2