Unit 1: Introduction to operations research
Operation Research Applications notes · PTU syllabus (MBA 952-18)
On this page
Unit summary
Operations research gives managers mathematical tools to find the best decision under constraints. This unit covers the historical development and origin of OR, managerial applications of optimisation, classical and advanced optimisation techniques, the general approach to solving OR problems, the classification of mathematical models and decision-making environments.
After this unit you can
- Trace the origin and development of OR
- Explain managerial applications of optimisation
- Distinguish classical and advanced optimisation techniques
- Classify OR models and decision-making environments
PTU syllabus topics
- Historical development
- managerial applications of optimization
- classical and advanced optimization techniques
- origin of OR
- general approach for solving OR problems
- classification of mathematical models and decision-making environments
Topic 1
Origin and historical development of OR
OR began in Britain during the Second World War, when teams of scientists studied military problems such as radar deployment and convoy protection. After the war, the methods spread to industry; George Dantzig developed the simplex method in 1947. Operations research is the application of scientific methods, techniques and tools to problems involving the operations of systems, to provide optimal solutions (Churchman, Ackoff and Arnoff). Evolution: began in Britain during World War II for radar deployment and convoy routing; after the war it spread to industry and government.
- 1Formulate the problem
- 2Build a mathematical model
- 3Derive a solution
- 4Test the model and solution
- 5Implement and control
Techniques: linear programming, transportation and assignment, game theory, sequencing, queuing, inventory models, PERT/CPM, simulation and decision theory. Applications: production planning, product mix, distribution, scheduling, finance and marketing.
- 1
1930s–1945
British and US military OR teams — radar, convoys, bombing (Blackett's circus)
- 2
1947
George Dantzig develops the simplex method
- 3
1950s
Game theory, dynamic programming (Bellman), queuing and inventory models spread to industry
- 4
1958
PERT (US Navy, Polaris) and CPM (DuPont)
- 5
1960s–80s
Computers enable large models; integer and network programming
- 6
1990s onward
Supply chain optimisation, metaheuristics, analytics and AI-based optimisation
Example
OR in business today: airlines use OR to schedule crews and set fares, retailers to plan stock, and courier companies to plan delivery routes.
Exam tip
Mention the wartime origin and the post-war spread to industry.
Topic 2
Managerial applications of optimisation
| Area | Optimisation application |
|---|---|
| Production | Product mix, blending, scheduling, capacity planning |
| Logistics | Transportation, vehicle routing, warehouse location |
| Finance | Portfolio selection, capital budgeting, cash management |
| Marketing | Media selection, sales territory allocation, pricing |
| HR | Staff scheduling, assignment of people to jobs |
| Projects | Scheduling with PERT and CPM, crashing |
| Services | Queue management in banks, hospitals, call centres |
Example
Indian Railways and airlines use optimisation models for crew and fleet scheduling; quick-commerce firms use routing models to deliver within minutes.
Topic 3
Classical and advanced optimisation techniques
Classical techniques use calculus to find the maximum or minimum of a function. Advanced techniques, such as linear and integer programming, handle many variables and constraints.
Basis
Differential calculus
Mathematical programming and computing
Methods
Unconstrained maxima and minima, Lagrange multipliers for equality constraints
Linear, integer, non-linear, dynamic and goal programming; network models; heuristics and metaheuristics (genetic algorithms, simulated annealing)
Problems suited
Smooth continuous functions, few variables
Large problems with many variables and inequality constraints
Limitation
Cannot handle inequality constraints easily
May need software; heuristics give near-optimal solutions
Example
Classical optimisation: profit P = 100x − 2x². Setting dP/dx = 100 − 4x = 0 gives x = 25 units. The second derivative is −4, which is negative, so profit is maximum at 25 units: P = 2,500 − 1,250 = ₹1,250.
Topic 4
General approach to solving OR problems
The OR approach has these steps: formulate the problem, construct a mathematical model, derive a solution, test the model and solution, establish controls, and implement. Operations research (OR) is the application of scientific methods, techniques and tools to problems involving the operations of a system so as to provide those in control with optimum solutions (Churchman, Ackoff and Arnoff). It originated in military operations during World War II.
- 1
Formulate the problem
- 2
Construct a mathematical model
- 3
Derive a solution
- 4
Test the model and solution
- 5
Establish controls
- 6
Implement
- Scope: production planning, inventory, transportation and logistics, finance (portfolio), marketing (media selection), HR (assignment), project scheduling.
- Objectives: optimise (maximise profit or minimise cost) under constraints; improve decision quality.
- Limitations: models simplify reality; data may be unavailable; costly; managers may not understand models; non-quantifiable factors ignored.
Example
Following the steps: a dairy wants to maximise profit from milk, curd and paneer with limited milk and machine hours. It formulates a linear programming model, solves it, checks the result against last month's data, and uses it to plan daily production.
Exam tip
Remember that a model is a simplified representation of reality — test it before using it.
Topic 5
Classification of mathematical models
OR models are classified by structure, purpose, certainty and time. A model is a simplified representation of a real system that can be analysed.
By structure
Iconic (scale models), analogue (graphs, flow charts), symbolic (mathematical equations)
By purpose
Descriptive (queuing, simulation), predictive, prescriptive or optimisation (LP)
By certainty
Deterministic (LP, EOQ) and probabilistic or stochastic (queuing, PERT)
By time
Static (single period) and dynamic (multi-period)
By method of solution
Analytical (exact formulas) and simulation (experiments on models)
Example
Types: a scale model of a factory layout is iconic. A graph of demand is analogue. The EOQ formula is symbolic. EOQ with known demand is deterministic; a queuing model with random arrivals is probabilistic.
Topic 6
Decision-making environments
Decisions are taken under certainty, risk or uncertainty, depending on how much is known about outcomes.
Certainty
Outcome of each action is known
Linear programming, transportation, assignment
Risk
Probabilities of outcomes are known
Expected monetary value, decision trees, PERT
Uncertainty
Probabilities unknown
Maximin, maximax, minimax regret, Hurwicz, Laplace criteria
Conflict
Outcome depends on an opponent's choices
Game theory
Example
Expected monetary value: stocking 100 units earns ₹5,000 if demand is high (probability 0.6) and loses ₹1,000 if low (0.4). EMV = 0.6 × 5,000 + 0.4 × (−1,000) = ₹2,600. Under uncertainty, with no probabilities, maximin would choose the option with the best worst outcome.
Exam tip
Risk: probabilities known, use EMV. Uncertainty: probabilities unknown, use maximax, maximin, Laplace, Hurwicz or minimax regret.
Key terms
- Operations research
- Scientific approach to optimal decisions in systems
- Symbolic model
- Model expressed in mathematical equations
- Deterministic model
- Model in which all values are known with certainty
- Metaheuristic
- General search strategy giving near-optimal solutions
- Decision under risk
- Decision where outcome probabilities are known
Quick revision
- Origin in World War II; Dantzig's simplex (1947); PERT and CPM (1958).
- Applications in production, logistics, finance, marketing, HR, projects, services.
- Classical (calculus, Lagrange) vs advanced (LP, IP, NLP, DP, heuristics).
- Phases: formulate, model, solve, test, control, implement.
- Models: iconic, analogue, symbolic; deterministic vs probabilistic; environments: certainty, risk, uncertainty, conflict.
Important exam questions
Practice questions written to the PTU exam pattern for this unit's syllabus: short answers (Section A style) and long answers (Sections B and C style).
Short-answer questions
- Q1.Define operations research.
- Q2.Who developed the simplex method and when?
- Q3.Distinguish classical and advanced optimisation techniques.
- Q4.What is a symbolic model?
- Q5.Distinguish deterministic and probabilistic models.
- Q6.Distinguish decision-making under risk and under uncertainty.
Long-answer questions
- Q1.Trace the origin and development of operations research.
- Q2.Discuss managerial applications of optimisation.
- Q3.Explain the general approach to solving OR problems.
- Q4.Explain the classification of OR models and decision-making environments.
Stuck on this unit?
Message SBS on WhatsApp for help with Operation Research Applications, or to ask about studying MBA at Synetic.
