|
| Course Content |
Time Allocated |
| L |
T |
P |
A |
Formulation of Models
- Nature of OR modeling, Modeling procedure
|
1 |
|
|
|
Linear Programming
- Graphical method, Simplex algorithm and extensions, Duality and dual simplex algorithm, Sensitivity analysis, Revised simplex algorithm, Transportation, Transhipment and assignment problems
|
12 |
3 |
|
|
Network Analysis
- Shortest route, Maximal flow, Minimum spanning tree problems, Project planning and control
|
9 |
2 |
|
|
Dynamic Programming
- Principle of optimality, Forward and backward recursions, Construction of algorithms
|
4 |
1 |
|
|
Queuing Theory
- Basic structure of queuing models, Role of exponential distribution, Birth and death processes, Priority discipline queuing models
|
4 |
1 |
|
|
Inventory Models
- Deterministic inventory models, Static EOQ models, Dynamic EOQ models, Use of dynamic programming algorithms
|
4 |
1 |
|
|
Simulation
- Types of simulation, Formulating and implementing a simulation model, Discrete event simulation
|
2 |
1 |
|
|
| Total = 45 |
36 |
9 |
|
|
| |
| Assessment |
Percentage Mark |
| Continuous Assessment |
|
20 |
| Assignment |
20 |
|
| Course work |
|
|
| Written Examinations |
|
80 |
| Mid-Semester |
20 |
|
| End of Semester |
60 |
|
|
Notation Used :
L - Lectures
T - Tutorials
P - Practical works
A - Assignments |