📘 MBA Semester III — Operations Research
(Paper I)
🎯 Objectives of Operations Research
Operations Research (OR) provides a quantitative and scientific approach for solving managerial
problems.
🔹 Main Objectives
Introduce mathematical models for decision-making
Improve managerial efficiency
Optimize utilization of resources
Support scientific business decisions
Analyze complex business situations
Evaluate alternative solutions systematically
🔹 Importance in Management
Operations Research helps managers in:
Production planning
Inventory control
Transportation
Scheduling
Risk analysis
Financial decision-making
Supply chain optimization
📚 UNIT I — Linear Programming
🔹 Introduction to Operations Research
✅ Definition
Operations Research is the application of scientific and mathematical techniques to managerial
decision-making problems.
✅ Features
Scientific approach
Quantitative analysis
Optimal decision-making
Systems orientation
Interdisciplinary approach
✅ Applications
Functional Area Applications
Production Product mix, scheduling
Marketing Advertising allocation
Finance Portfolio optimization
HR Manpower planning
Logistics Distribution planning
🔷 Linear Programming Problem (LPP)
🔹 Meaning
Linear Programming is a technique used to maximize or minimize an objective function subject to
constraints.
🔹 Components of LPP
✅ Decision Variables
Variables whose values are to be determined.
Example:
x = number of units produced
✅ Objective Function
Function to be optimized.
Example:
Maximize Profit:
Z = 5x + 3y
✅ Constraints
Limitations or restrictions.
Example:
2x + y ≤ 100
✅ Non-negativity Restrictions
Variables cannot be negative.
x ≥ 0, y ≥ 0
🔷 Methods of Solving LPP
🔹 Graphical Method
✅ Used When
Only two decision variables exist
✅ Procedure
1. Formulate LPP
2. Draw constraint lines
3. Identify feasible region
4. Find corner points
5. Evaluate objective function
✅ Advantages
Simple
Visual understanding
❌ Limitations
Cannot solve large problems
🔹 Simplex Method
✅ Meaning
An iterative mathematical procedure used to solve complex LP problems.
✅ Important Concepts
Basic variables
Slack variables
Pivot element
Optimal solution
✅ Steps
1. Convert inequalities into equations
2. Prepare simplex table
3. Identify entering variable
4. Identify leaving variable
5. Perform iterations
6. Obtain optimal solution
🔹 Special Cases in LPP
✅ Degeneracy
Occurs when a basic variable becomes zero.
✅ Unbounded Solution
Objective function increases indefinitely.
✅ Infeasible Solution
No feasible region exists.
✅ Multiple Optimal Solutions
More than one optimal solution exists.
🔷 Dual Simplex Method
🔹 Meaning
A variation of simplex method used when the initial solution is infeasible but optimal.
✅ Advantages
Faster in some cases
Useful in sensitivity analysis
🔷 Duality in LPP
🔹 Principle of Duality
Every LP problem has another associated LP problem called the dual.
✅ Importance
Simplifies computations
Provides economic interpretation
Helps in sensitivity analysis
🔷 Sensitivity Analysis
🔹 Meaning
Study of changes in optimal solution due to parameter changes.
✅ Applications
Cost analysis
Profit analysis
Resource allocation decisions
📚 UNIT II — Transportation Models
🔷 Transportation Problem
🔹 Meaning
A special LP problem used to minimize transportation cost.
🔹 Types
✅ Balanced Transportation
Total supply = Total demand
✅ Unbalanced Transportation
Total supply ≠ Total demand
🔷 Initial Basic Feasible Solution (IBFS)
🔹 North-West Corner Rule
✅ Procedure
Start from top-left corner
Allocate maximum possible quantity
Move row-wise or column-wise
✅ Advantage
Simple method
❌ Limitation
May not give minimum cost solution
🔹 Least Cost Method
✅ Procedure
Select minimum transportation cost cell
Allocate maximum quantity
Repeat until completed
✅ Advantage
Better than NW corner method
🔹 Vogel’s Approximation Method (VAM)
✅ Meaning
Most efficient IBFS method.
✅ Steps
1. Find penalties
2. Select highest penalty
3. Allocate to lowest cost cell
4. Repeat
✅ Advantage
Near-optimal solution
🔷 Optimality Test
🔹 MODI Method
✅ Purpose
Checks whether solution is optimal.
✅ Features
Efficient
Reduces computations
🔹 Stepping Stone Method
✅ Purpose
Alternative optimality testing method.
🔷 Degeneracy in Transportation
🔹 Meaning
Occurs when allocations are less than (m + n − 1).
✅ Solution
Introduce ε (epsilon) allocation.
🔷 Transshipment Models
🔹 Meaning
Goods move through intermediate points before destination.
✅ Applications
Warehousing
Multi-stage logistics
📚 UNIT III — Integer Programming & Game
Theory
🔷 Integer Programming
🔹 Meaning
Programming problems where variables must be integers.
🔹 Types
✅ Pure Integer Programming
All variables are integers.
✅ Mixed Integer Programming
Some variables are integers.
🔷 Methods
🔹 Branch and Bound Method
✅ Procedure
Solve LP relaxation
Branch fractional variables
Continue until integer solution obtained
✅ Advantage
Widely used method
🔹 Cutting Plane Method
✅ Meaning
Cuts off fractional solutions iteratively.
🔷 Game Theory
🔹 Meaning
Study of competitive decision-making situations.
🔹 Two-Person Zero-Sum Game
✅ Concept
Gain of one player = Loss of another player.
🔷 Saddle Point
🔹 Meaning
When maximin = minimax.
✅ Result
Pure strategy solution exists.
🔷 Dominance Rule
🔹 Meaning
Inferior strategies are eliminated.
✅ Advantage
Simplifies game matrix.
🔷 Mixed Strategy
🔹 Meaning
Players use probabilities for strategies.
🔷 Methods of Solution
🔹 Matrix Method
Used for small games.
🔹 Graphical Method
Used for 2 × n or m × 2 games.
🔹 LP Method
Game problem converted into LP problem.
📚 UNIT IV — Dynamic Programming &
Decision Theory
🔷 Dynamic Programming (DP)
🔹 Meaning
Technique for solving multistage decision problems.
🔹 Characteristics
Sequential decisions
Recursive relationship
Stage-wise optimization
🔷 Deterministic DP
🔹 Meaning
Outcomes are known with certainty.
🔷 Maximization & Minimization Problems
✅ Applications
Inventory management
Resource allocation
Capital budgeting
🔷 DP for LP Problems
🔹 Concept
LPP solved stage-by-stage using DP.
🔷 Decision Theory
🔹 Decision Making Under Risk
✅ Meaning
Probabilities are known.
✅ Techniques
Expected Monetary Value (EMV)
Expected Opportunity Loss (EOL)
🔹 Decision Making Under Uncertainty
✅ Meaning
Probabilities are unknown.
✅ Criteria
Maximax
Maximin
Minimax Regret
Laplace Criterion
🔷 Decision Trees
🔹 Meaning
Graphical representation of decision alternatives.
✅ Components
Decision nodes
Chance nodes
Branches
✅ Advantages
Easy analysis
Visual understanding
🔷 Simulation Techniques
🔹 Meaning
Imitation of real-life systems using models.
✅ Applications
Banking systems
Manufacturing
Traffic systems
Risk analysis
✅ Advantages
Handles uncertainty
Useful for complex systems
📚 UNIT V — Queuing Theory & Replacement
Models
🔷 Queuing Theory
🔹 Meaning
Mathematical study of waiting lines.
🔷 Components of Queue
✅ Calling Population
Customers entering system.
✅ Queue Discipline
Order of service.
Example:
FIFO
LIFO
Priority
✅ Service Mechanism
Service channels and phases.
🔷 Single Channel Queue
🔹 Meaning
Only one service channel exists.
✅ Example
Single ATM counter
🔷 Multi-Channel Queue
🔹 Meaning
More than one service channel exists.
✅ Example
Bank counters
🔷 Infinite Calling Source
🔹 Meaning
Large customer population.
🔷 Performance Measures
✅ Average Queue Length
✅ Average Waiting Time
✅ System Utilization
✅ Probability of Waiting
🔷 Replacement Models
🔹 Meaning
Determine optimal replacement time of equipment.
🔷 Types of Replacement
✅ Individual Replacement
Items replaced separately after failure.
✅ Group Replacement
All items replaced together periodically.
🔷 Replacement with Time Value of Money
🔹 Meaning
Considers present value of future costs.
🎯 Important Numerical Areas
⭐ Very Important Topics
Graphical Method
Simplex Method
Duality
Transportation Problems
MODI Method
Game Theory
Decision Trees
Queuing Models
🎯 Most Important Theory Areas
⭐ Frequently Asked Questions
Applications of OR
Sensitivity Analysis
Dynamic Programming
Simulation
Replacement Policies
Decision Making Under Risk & Uncertainty
📌 Exam Preparation Tips
✅ Step 1 — Understand Concepts
Focus on:
Objective function
Constraints
Optimization logic
✅ Step 2 — Practice Numericals
Daily practice is essential for:
Simplex
Transportation
Game Theory
Queuing
✅ Step 3 — Memorize Procedures
Remember:
Transportation steps
MODI iterations
Queue formulas
✅ Step 4 — Focus on Applications
MBA exams expect managerial interpretation along with calculations.
📚 Reference Books
📖 Primary References
1. Paneerselvam R. — Operations Research
2. Hamdy Taha — Operations Research
🏁 Conclusion
Operations Research is a powerful managerial decision-making tool combining:
Mathematics
Statistics
Optimization
Strategic analysis
The subject is highly scoring when:
Numerical methods are practiced regularly
Procedures are memorized properly
Concepts are understood clearly