The document outlines the syllabus for an Operations Research course, detailing five units covering topics such as Linear Programming, Transportation and Assignment Problems, Game Theory, Queuing Models, and PERT & CPM. It includes a model question paper with various sections designed to assess understanding of the material, including multiple-choice questions, fill-in-the-blanks, and descriptive answers. The syllabus emphasizes both theoretical concepts and practical applications of Operations Research techniques.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0 ratings0% found this document useful (0 votes)
41 views3 pages
Operations Research Syllabus Model Question Paper
The document outlines the syllabus for an Operations Research course, detailing five units covering topics such as Linear Programming, Transportation and Assignment Problems, Game Theory, Queuing Models, and PERT & CPM. It includes a model question paper with various sections designed to assess understanding of the material, including multiple-choice questions, fill-in-the-blanks, and descriptive answers. The syllabus emphasizes both theoretical concepts and practical applications of Operations Research techniques.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3
Operations Research - Syllabus & Model Question Paper
UNIT I: Introduction to Operations Research
Operations Research - Definition & Characteristics - Nature and Scope of Operations Research, Methodology of Operations Research, Application Areas of Operations Research and Techniques of Operations Research - Linear Programming, Queuing Theory, Game Theory, Inventory Control Models, Sequencing, Replacement Model, Network Scheduling Models and Simulation. (Theory only)
UNIT II: Linear Programming Problem
Linear Programming Problem - Requirements for a Linear Programming Problem, Basic Assumptions of Linear Programming - Mathematical Formulation - Application Areas of Linear Programming - Graphical Solution, Simplex Method, Degeneracy in LPP - Duality in Linear Programming - Characteristics of the Dual Problem - Conversion of Primal into Dual.
UNIT III: Transportation and Assignment Problems
Transportation and Assignment problems - Initial Basic Feasible Solution - The North-West Corner Method, Least Cost Method and Vogel's Approximation Method, Testing of Optimality (MODI method only) - Maximization Case, Unbalanced problems. Assignment Problem - Hungarian Method, Special cases in Assignment Problems - Maximization case, Multiple optimum solutions, Unbalanced Assignment Problem and Prohibited Assignments.
UNIT IV: Game Theory and Queuing Models
Game Theory: Introduction - Rules for Game Theory - Two-person zero-sum game without saddle point - Mixed strategies (2xn games, m×2 games) - Graphical method (2xn games, m×2 games). Queuing Models: Cost of Waiting Line situations, Characteristics of Queuing Systems - Single Channel Waiting model - (M/M/1):(FCFS) & (M/M/1):(N/FCFS) Models only. UNIT V: PERT & CPM Network Analysis - Objectives of Network Analysis - PERT and CPM, Rules for Network construction, Critical Path Analysis - Float Vs Slack, Three time estimates for PERT - Total float, Free float, Independent float, Distinction between PERT and CPM. (Excluding Project Time-Cost Trade-Off)
MODEL QUESTION PAPER (75 Marks)
Section A (20 Marks)
1. Choose the best answer (1×5=5) - Example: What is Operations Research? a) A method for decision-making b) A mathematical tool c) Both a & b d) None Answer: c) Both a & b
2. Fill in the blanks (1×5=5)
- Example: The Simplex method is used to solve ______ problems. Answer: Linear Programming
3. Answer in one or two sentences (1×10=10)
- Example: Define Operations Research. Answer: Operations Research is a discipline that applies advanced analytical methods to help make better decisions.
Section B (25 Marks)
Answer any 5 questions (5×5=25) 1. Explain the scope of Operations Research. 2. What are the assumptions of Linear Programming? 3. Explain the North-West Corner Method in transportation problems. 4. Define Zero-sum games and give an example. 5. What is the Critical Path in CPM?
Section C (30 Marks)
Answer any 3 questions (3×10=30) 1. Explain the methodology of Operations Research. 2. Solve the following Linear Programming Problem using the graphical method: Maximize Z = 3x + 2y Subject to: x + y <= 4 2x + y <= 5 x, y >= 0 3. Explain the MODI method for solving transportation problems. 4. Discuss the difference between PERT and CPM with examples. 5. Explain the characteristics of Queuing Systems with examples.