IE 3034 • Midterm II + Final • Operations Research II

Introduction

Example 1

Example 2

An Important Question

Knapsack Problem and Branch&Bound

Knapsack Problemi B&B Example

Method

Example 1

Example 2

A New Approach to Optimization Problems

Inventory Problems

Inventory Problems Example 1

Resource Allocation Problems

Resource Allocation Problems Example 1

Markov Property & One Step Transition Matrix

N-Step Transition Matrix

Unconditional Probabilities

Exam-like Question 1

Classification of States

Steady State Probabilities 1

Steady State Probabilities 2

Expected Recurrence Time

Exam-like Question 3

First Passage Time

Expected First Passage Time

Absorbing State

Best Exam-like Question

Creating a Transition Matrix (Important)

Exam-like Question 5

Branch and Bound 1

Branch and Bound 2

Branch and Bound 3

Cutting Plane 1

Cutting Plane 2

Deterministic Dynamic Programming 1

Deterministic Dynamic Programming 2

Deterministic Dynamic Programming 3

Deterministic Dynamic Programming 4

Deterministic Dynamic Programming 5

Deterministic Dynamic Programming 6

Deterministic Dynamic Programming 7

Deterministic Dynamic Programming 8

Deterministic Dynamic Programming 9

Markov Chains 1

Markov Chains 2

Markov Chains 3

Markov Chains 4

Markov Chains 5

Markov Chains 6

Markov Chains 7

Markov Chains 8

Markov Chains 9