AD-504 (C) RGPV B.Tech
Operations Research (OR)
The official syllabus is free to read, no account needed.
Syllabus, notes and important questions for AD-504 (C)
- Syllabus Official RGPV syllabus Free
- Notes 5 documents Free
- Previous Year Papers None for AD-504 (C) yet
- Important Questions None for AD-504 (C) yet
Syllabus units
Topics as the official RGPV syllabus lists them.
Unit 1 Origin & Development of OR and Linear Programming 13 topics
- Origin and development of Operations Research (OR)
- Different phases of OR study
- Methodology of OR
- Scope and limitations of OR
- OR in decision making
- Linear Programming – introduction
- Mathematical formulation of LP problems
- Graphical solution methods
- Standard forms of LP
- Simplex method for maximization problems
- Simplex method for minimization problems
- Interpretation of duality in LP
- Dual simplex method
Unit 2 Transportation and Assignment Problems 6 topics
- Transportation problem (TP) formulation
- Finding a basic feasible solution for TP
- Optimal solution methods for TP
- Assignment problem formulation
- Hungarian method for solving assignment problems
- Travelling Salesman Problem (TSP) overview
Unit 3 Project Scheduling – PERT and CPM 9 topics
- Project scheduling using PERT and CPM with known activity times
- Critical Path Analysis
- Types of float (total, free, etc.)
- Probability considerations in PERT
- Updating PERT charts
- Project crashing techniques
- Formulation of CPM as a linear programming problem
- Resource leveling
- Resource scheduling
Unit 4 Sequencing, Job‑Shop Problems and Dynamic Programming 6 topics
- Introduction to sequencing problems
- Flow‑shop problem – processing n jobs through 2, 3 and m machines
- General n/m job‑shop problem
- Introduction to dynamic programming
- Dynamic‑programming approach for solving linear programming problems
- Applications of dynamic programming in OR
Unit 5 Queueing Theory 7 topics
- Introduction to queuing theory
- Classification of queuing systems and their characteristics
- Pure‑birth and pure‑death models
- Kendall and Lee’s notation for queuing systems
- Empirical queuing models
- Numerical analysis of M/M/1 queuing model
- Numerical analysis of M/M/c queuing model