You are on page 1of 2

# MSOR – Mid Term Syllabus

Year - 2011

UINT -1

## • OR Concepts and definitions (Verma + Mahajan)

• Modeling (Mahajan + verma)
• Components of Model (Mahajan + Verma)
• Types of OR Models (Mahajan)
• Effect of Data Availability on Modeling
• Computations in OR (verma)
• Phases and Processes of OR (Verma or mahajan)
• Phases of OR Study (Verma)
• Limitations of OR (verma)

UINT – 2

## LINEAR PROGRAMMING** (Mahajan)

• Concepts of LPP
• Formulation of Models
• Graphical Solution
• Maximization/minimization problem
• Simplex Method (Algorithm)
• Use of Slack/Surplus/Artificial Variables
• Big M and Two Phase method
• Nature and type of Solutions
• Interpretation of Optimal Solution
• Dual problem
• Dual Simplex method
• Introduction to Integer programming
• Sensitivity analysis
• Introduction to TORA (Taha)

UINT – 4

NETWORK ANALYSIS

## • Network Definition (Taha)

• Minimal Spanning tree algorithm (Taha + Verma)
• Shortest Route Problem (Taha)
• Maximal Flow Problem (Taha)
• CPM & Perm (Taha + Vohra)
- Network Representation and arrow diagram rules (Vohra)
- Drawing a network diagram (Vohra)
- Importance of dummy activities (Taha + Vohra)
- Examples from Taha and Vohra
- Float Calculations (vohra)
- Forward pass and backward pass calculation (Taha)
- Critical Path and critical activities with rules and algorithm(Vohra)
- PERM with a,b,m timings (Vohra)
- Examples based on PERM/CPM (Taha + Vohra)
- Difference between PERT and CPM (vohra)

**************************************