| Lecture No. |
Description |
Lecture By |
| Lecture 1 |
Meaning & Approaches of Probability Theory |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 2 |
Addition & Multiplication Theorems |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 3 |
Conditional Probability |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 4 |
Bay’s Rule |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 5 |
Probability Distributions |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 6 |
Binomial Poisson |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 7 |
Normal Distributions |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 8 |
Application of Probability Theory in Business Decision making |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 9 |
Linear Programming-Meaning |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 10 |
Assumptions of Linear Programming |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 11 |
Formulation of Linear Programming Model |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 12 |
Solution of Linear Programming Problem with the help of Graphical Method-1 |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 13 |
Solution of Linear Programming Problem with the help of Graphical Method-2 |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 14 |
Concept of Duality |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 15 |
Shadow Prices |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 16 |
Sensitivity Analysis |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 17 |
Application Sensitivity Analysis |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 18 |
Role LP in Economic Decision Making |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 19 |
Transportation Problem-Initial Basic Feasible Solution |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 20 |
Transportation Problem Test for Optimality |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 21 |
Degeneracy in Transportation Problem |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 22 |
Assignment Problems |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 23 |
Application of Assignment Problems |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 24 |
Travelling Salesman Model Problem |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 25 |
Decision Making under Certainty |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 26 |
Decision Making under Certainty & Risk |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 27 |
Decision Tree Analysis Overview |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 28 |
Application of Decision Tree Analysis |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 29 |
Game Theory-Pure Strategies |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 30 |
Game Theory-Mixed Strategies |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 31 |
Principle of Dominance |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 32 |
Solution of game theory problems with the help of graphical method-1 |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 33 |
Solution of game theory problems with the help of graphical method-2 |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 34 |
Solution of game theory problems with the help of simplex method |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 35 |
Meaning of Networking |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 36 |
Network Analysis with help of PERT Models |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 37 |
Network Analysis with help of CPM Models |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 38 |
Resource Planning |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 39 |
Meaning of Crashing |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 40 |
Queuing Theory – Meaning |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 41 |
Concept of Queuing Models |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 42 |
Assumptions of Queuing Models |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 43 |
M/M/1/FIFO-1 |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 44 |
M/M/1/FIFO-2 |
Lecture by A, Lecture by B, Lecture by C, Lecture by D |
| Lecture 45 |
Simulation Modeling |
Lecture by Dr.Kanika Gupta, Lecture by B, Lecture by C, Lecture by D |