30:21

Shortest Path Problems (Contd.)

29:49

Shortest Path Problems

28:56

Maximal Flow Problems (Contd.)

30:30

Maximal Flow Problems

31:33

Fundamental Circuits and Network Simplex Method

31:54

Introduction to Graph Theory

30:45

Introduction (Contd.)

30:50

Operations on a Graph, Tree and Spanning Tree

35:03

Minimal Spanning Tree

32:47

Cutsets

28:34

System Dynamics Example

33:40

Continuous Simulation and System Dynamics

27:33

Variance Reduction and Simulation Software

30:21

Monte-Carlo Simulation and Output Analysis

28:43

Simulation Examples (Contd.)

30:56

Introduction to Simulation

30:26

Pseudo random Numbers

31:31

Discrete-Event and Monte-Carlo Simulation

31:29

Simulation Examples

30:31

Generation of Random Variates

29:51

Queuing Examples (Contd.)

34:45

M/D/1 and M/M/s Queuing Models

30:39

M/M/s and M/M/infinity Models

32:30

Queuing Cost, Priority and Networking Models

29:19

Finite Queue Space and Queuing Cost Models

30:56

Introduction to Waiting Lines

30:01

Poisson and Exponential Distribution

30:21

Birth and Death Process

28:37

Queuing Examples

30:28

M/M/1 Queing Model

29:32

Decision Tree

33:55

Bayes Theorem

31:13

Decision Problem with Experimentation

26:08

Decision Problem with Experimentation (Contd.)

26:22

Decision Problem Example

12:49

Prof Biswajit Mahanty

30:26

Decision Making Under Risk

29:35

Decision Analysis

26:51

Payoff Matrix

27:13

Value of Information

31:41

Probability Concepts

06:15

Prof. Biswajit Mahanty