IE 343 • Midterm • Mathematical Modeling and Exact Methods

Convex Sets

Example 1

Convex Functions

Example 2

Example 3

Example 4

Duality

Example 5

Example 6

IP Problems and Solutions

NP Complete - NP Hard

Example 1

Heuristics Methods

Analyzing Complexity

Example 2

Example 3

Big-O Notation

Example 4

Pseudo Polynomial Time

Example 5

Optimization Overview 1

Optimization Overview 2

Optimization Overview 3

Complexity Analysis 1

Complexity Analysis 2

Complexity Analysis 3

Complexity Analysis 4

Complexity Analysis 5

Complexity Analysis 6

Introduction

Mathematical Modelling

Example 1

Mathematical Modelling

Example 2

Example 3

Example 4

Bottom-Up Algorithm

Example 1

Example 2

Bottom-Up Algorithm’s Pseudocode

Example 3

Top-Down Algorithm

Example 4

Example 5

Top-Down Algorithm’s Pseudocode

Knapsack Problems and Heuristic Methods 1

Knapsack Problems and Heuristic Methods 2

Knapsack Problems and Heuristic Methods 3

Knapsack Problems and Heuristic Methods 4

Knapsack Problems and Heuristic Methods 5

Knapsack Problems and Heuristic Methods 6

Knapsack Problems and Heuristic Methods 7

Knapsack Problems and Heuristic Methods 8

Knapsack Problems and Heuristic Methods 9

Knapsack Problems and Heuristic Methods 10

Branch

Bound

Example 1

Example 2

Example 3

Exam Like Question 1

Exam Like Question 2

Exam Like Question 3

Exam Like Question 4 (IE 342 Çıkmış)

Exam Like Question 5 (IE 342 Çıkmış)

What is Integer Programming?

Constraints with Binary Variables

Special Constraints

Non-Linear Objectives

Piecewise Linear Example

Absolute Value Example

Max-Min Example

If-then --> Either-or

Example 1

Example 2

Exam Like Question 1

Exam Like Question 2

Exam Like Question 3 (IE 342 Çıkmış)

Exam Like Question 4 (IE 342 Çıkmış)

Exam Like Question 5

Exam Like Question 6