IE 323 • Final • Operations Research II

What is a network?

Shortest Path Problems

Dijkstra's Algorithm

Example 1

Example 2

Example 3

Example 4

Example 5

Maximum Flow Problems

Minimum Cut

Ford Fulkerson Algorithm

Example 1

Example 2

Boss of Network Problems

Example 1

Exam Like Question 1

What is a Minimum Spanning Tree?

Prim's Algorithm

Example 1

Example 2

What is a project network?

Drawing a Project Network

Example 1

Critical Path Method (CPM)

Example 2

Total & Free Float

Example 3

What is NLP?

One Variable Unconstrained Optimization

Convexity

Bisection method

Example 1

Example 2

Newton's method

Example 3

Example 4

Multivariable Unconstrained Optimization

Convexity

Gradient Search Algorithm

Example 1

Shortest Path Problem 1

Shortest Path Problem 2

Shortest Path Problem 3

Shortest Path Problem 4

Shortest Path Problem 5

Maximum Flow Problem 1

Maximum Flow Problem 2

Maximum Flow Problem 3

Maximum Flow Problem 4

Maximum Flow Problem 5

Maximum Flow Problem 6

Minimum Spanning Tree 1

Minimum Spanning Tree 2

Minimum Spanning Tree 3

Project Network 1

Project Network 2

Project Network 3

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

Non-Linear Programming 9

Non-Linear Programming 10

Non-Linear Programming 11

Non-Linear Programming 12