IE 301 • Operations Research II • Midterm II + Final

A New Approach to Optimization Problems

Inventory Problems

Example 1

Example 2

Resource Allocation Problems

Example 3

Example 4

Example 5

Solving NLPs with Dynamic Programming (Integer Variables)

Solving NLPs with Dynamic Programming (Continuous Variables)

What is the difference?

Example 1

Example 2

Example 3

Markov Property & 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 2

First Passage Time

Expected First Passage Time

Absorbing State

Average Cost-Complex Cost (Important)

Expected Total Discounted Cost

Transition Rate Matrix

Steady State Equations

Transition Rate Matrix 2

DP - Inventory Problems 1

DP - Inventory Problems 2

DP - Resource Allocation Problems 1

DP - Resource Allocation Problems 2

DP - Resource Allocation Problems 3

DP - Resource Allocation Problems 4

NLP with Dynamic Programming 1

NLP with Dynamic Programming 2

Probabilistic Dynamic Programming 1

Probabilistic Dynamic Programming 2

Probabilistic Dynamic Programming 3

Probabilistic Dynamic Programming 4

Discrete Time Markov Chains 1

Discrete Time Markov Chains 2

Discrete Time Markov Chains 3

Discrete Time Markov Chains 4

Discrete Time Markov Chains 5

Continuous Time Markov Chains 1

Continuous Time Markov Chains 2

Continuous Time Markov Chains 3