IE 333 • Final • Operations Research II - Deterministic Problems

Definition / LP Solution

Assumptions of the Problem

Least Cost Method

Least Cost Method Example 1

Least Cost Method Example 2

Northwest Corner Method

Northwest Corner Method Example 1

Northwest Corner Method Example 2

Vogel's Method

Vogel's Method Example 1

Transportation Simplex Method

Example 1

Example 2

Example 3

Definition / LP Solution

Assumptions of the Problem

Hungarian Method

Hungarian Method: Trouble in Paradise

Example 1

Example 2

What is a network?

Shortest Path Problems

Dijkstra's Algorithm

Djikstra's Algorithm Example 1

Djikstra's Algorithm Example 2

Shortest Path Problem Example 1

Shortest Path Problem Example 2

Shortest Path Problem Example 3

General Procedure

Initial BFS

Iterations

Example

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

What is NLP?

One Variable Unconstrained Optimization

Convexity in Detail

Multivariable Unconstrained Optimization

Convexity in Detail

KKT Conditions

Example

Transportation Simplex Method 1

Transportation Simplex Method 2

Hungarian Method 1

Hungarian Method 2

Hungarian Method 3

Hungarian Method 4

Djikstra's Algorithm 1

Djikstra's Algorithm 2

Network Simplex Method 1

Network Simplex Method 2

Branch and Bound 1

Branch and Bound 2

Branch and Bound 3

Branch and Bound 4

Branch and Bound 5

Cutting Plane 1

Cutting Plane 2

Dynamic Programming 1

Dynamic Programming 2

Dynamic Programming 3

Dynamic Programming 4

Dynamic Programming 5

Dynamic Programming 6

Dynamic Programming 7

Non-Linear Programming 1

Non-Linear Programming 2

Non-Linear Programming 3

Non-Linear Programming 4

Non-Linear Programming 5

Non-Linear Programming 6

Non-Linear Programming 7

Non-Linear Programming 8