IE 201 • Midterm I • Operations Research I

What is Linear Programming?

Example 1

Example 2

Example 3

Example 4

Example 5

Example 6

Example 7

Example 8

Example 9

Example 10

What is different?

Piecewise Linear Example

Absolute Value Example

Max-Min Example

Are we doing something new?

Example 1

Example 2

Example 3

End of Topic Question 1

Using Integer Variables

Soru Tipi: Fixed Cost Problems

Example 1

Constraints with Binary Variables

Special Constraints

Soru Tipi: Assignment Problems

Example 2

Soru Tipi: Set Covering Problems

Example 3

Solving LP with 2 variables

Example 1

Example 2

Example 3

Alternative Optimal Solutions

Example 4

Standard Form of LP

Example 1

Basic Solutions - Basic Feasible Solutions

Example 2

Convex Functions

Example 3 & 4

Convex Sets

Polyhedral Set

Extreme Points and Directions

Example 5

Representing Points in Terms of Extreme Points/Directions (Minkowski's Theorem)

Question 1

Question 2

Question 3

Question 4

Modeling 1

Modeling 2

Modeling 3

Modeling 4

Modeling 5

Modeling 6

Modeling 7

Modeling 8

Modeling 9

Modeling 10

Modeling 11

Modeling 12

Modeling 13

Modeling 14

Modeling 15

Modeling 16

Modeling 17

Modeling 18

Modeling 19

Graphical Solution 1

Graphical Solution 2

Graphical Solution 1

Graphical Solution 2

Foundations of Simplex Method 1

Foundations of Simplex Method 2

Foundations of Simplex Method 3