MS University M.Com 1st Year 1st Semester Operations Research Important Questions November 2026
Manonmaniam Sundaranar University M.Com 1st Year 1st Semester Operations Research Important Questions November 2026
Manonmaniam Sundaranar University M.Com First Year First Semester Operations Research Important Questions for November 2026 are provided here for students preparing for their semester examinations.
This study material from MH Educational Blog includes unit-wise important questions, 1-mark MCQs, 5-mark questions, 8-mark questions, solved numerical examples, important formulas and examination preparation tips.
Students can use this article as a revision guide for all five units of Operations Research.
Operations Research – November 2026 Examination Pattern
| Part | Question Pattern | Marks |
|---|---|---|
| Part A | 10 MCQs | 10 |
| Part B | 5 Either/Or Questions | 25 |
| Part C | 5 Either/Or Questions | 40 |
| Total | 75 Marks | |
Preparation strategy:
- Part A: Memorise definitions, concepts and formulas.
- Part B: Prepare short numerical problems and theoretical explanations.
- Part C: Practise lengthy numerical problems and detailed theoretical answers.
UNIT 1 – LINEAR PROGRAMMING PROBLEM AND BASICS OF OPERATIONS RESEARCH (CO1)
Part A – Important 1-Mark Questions
- The restrictions in an LPP are called Constraints.
- The Simplex Method is used to solve an LPP.
- Operations Research is a scientific and multidisciplinary approach.
- The feasible region of an LPP is always convex.
- Slack variable is used for less than or equal to (≤) constraints.
- Surplus variable is used for greater than or equal to (≥) constraints.
- Artificial variables are introduced for equality and greater-than-or-equal-to constraints when required.
- Operations Research began in India in 1949.
Part B – Important 5-Mark Questions
- Solve the following LPP using the Graphical Method:
Min Z = −x1 + 2x2
Subject to:
−x1 + 3x2 ≤ 10
x1 + x2 ≤ 6
x1 − x2 ≤ 2
x1, x2 ≥ 0. - Solve the following problem using the Simplex Method:
Max Z = 3x1 + 4x2
Subject to:
x1 + x2 ≤ 450
2x1 + x2 ≤ 600
x1, x2 ≥ 0. - Solve a Simplex Method problem involving Max Z = 4x1 + 10x2.
- Formulate an LPP for a product-mix problem.
- Formulate an LPP for a diet problem involving eggs and milk.
- Formulate an LPP for K Ltd. based on available man-hours.
- Explain the benefits and advantages of Operations Research.
- Explain the characteristics of a Linear Programming Problem.
- Discuss the phases of Operations Research.
Part C – Important 8-Mark Questions
- Solve graphically:
Max Z = 8x1 + 6x2
Subject to:
2x1 + x2 ≤ 1000
x1 + x2 ≤ 800
x1 ≤ 400
x2 ≤ 700
x1, x2 ≥ 0. - Solve graphically:
Max Z = 12x1 + 16x2
Subject to:
10x1 + 20x2 ≤ 120
8x1 + 8x2 ≤ 80
x1, x2 ≥ 0. - Formulate or solve the leather belts problem involving two products A and B, with profits of Rs. 4 and Rs. 3 respectively, subject to the given resource limitations.
- Solve a three-variable problem using the Simplex Method.
- Solve an LPP using the Big-M Method.
- Explain the limitations of Operations Research.
- Explain the steps involved in formulating an LPP.
Solved Example – Graphical Method
Problem: Maximise Z = 3x + 2y, subject to:
- x + y ≤ 4
- x ≤ 2
- y ≤ 3
- x, y ≥ 0
Step 1: Identify the corner points.
The feasible region has the following corner points:
(0,0), (2,0), (2,2), (1,3), (0,3).
Step 2: Calculate the objective function.
| Corner Point | Z = 3x + 2y |
|---|---|
| (0,0) | 0 |
| (2,0) | 6 |
| (2,2) | 10 |
| (1,3) | 9 |
| (0,3) | 6 |
Step 3: Identify the maximum value.
Optimal solution: x = 2, y = 2.
Maximum Z = 10.
Revision Tip: Practise Graphical Method, Simplex Method, Big-M Method and LPP formulation.
UNIT 2 – TRANSPORTATION AND ASSIGNMENT PROBLEMS (CO2)
Part A – Important 1-Mark Questions
- Number of basic cells in a non-degenerate solution = m + n − 1.
- Least Cost Method selects the lowest cost cell.
- Transportation cost to a dummy destination is zero.
- Allocated cells are called occupied cells.
- Hungarian Method is used for Assignment Problems.
- Unequal numbers of jobs and persons require a dummy row or column.
- A balanced transportation problem has equal total supply and demand.
Part B – Important 5-Mark Questions
- Solve the following transportation problem using the North-West Corner Method. Supply: 250, 300, 400. Demand: 200, 225, 275, 250.
- Solve a transportation problem using the Least Cost Method.
- Solve a 3 × 4 transportation problem using the Least Cost Method.
- Solve a 4 × 4 Assignment Problem using the Hungarian Method.
- Differentiate between Transportation and Assignment Problems.
Part C – Important 8-Mark Questions
- Solve a 3 × 4 or 4 × 5 transportation problem using Vogel's Approximation Method (VAM).
- Test the optimality of an initial transportation solution using the MODI Method.
- Solve a 4 × 3 transportation problem using the North-West Corner Method and optimise the solution.
- Solve an unbalanced Assignment Problem involving four tasks and three persons using the Hungarian Method.
- Explain the different methods of finding an Initial Basic Feasible Solution.
- Explain the Stepping-Stone Method.
- Explain the steps involved in the Hungarian Method.
Solved Example – North-West Corner Method
Problem: Three sources have supplies of 250, 300 and 400 units. Four destinations have demands of 200, 225, 275 and 250 units. Find the initial allocation using the North-West Corner Method.
Step 1: Check whether the problem is balanced.
Total supply = 250 + 300 + 400 = 950.
Total demand = 200 + 225 + 275 + 250 = 950.
Therefore, the problem is balanced.
Step 2: Allocate using the North-West Corner Method.
| Source | D1 | D2 | D3 | D4 | Supply |
|---|---|---|---|---|---|
| S1 | 200 | 50 | – | – | 250 |
| S2 | – | 175 | 125 | – | 300 |
| S3 | – | – | 150 | 250 | 400 |
| Demand | 200 | 225 | 275 | 250 | 950 |
Step 3: Count the occupied cells.
Number of occupied cells = 6.
For a non-degenerate solution, m + n − 1 = 3 + 4 − 1 = 6.
Note: A transportation cost table is required to calculate total transportation cost and test optimality.
Revision Tip: Practise North-West Corner Method, Least Cost Method, VAM, MODI and Hungarian Method.
UNIT 3 – SEQUENCING AND GAME THEORY (CO3)
Part A – Important 1-Mark Questions
- A machine processes one job at a time.
- The number of possible sequences for n jobs is n!.
- Four jobs have 4! = 24 possible sequences.
- Elapsed time is the time from the beginning of the first job until completion of the last job.
- Mixed strategy 2 × n games can be solved graphically.
- A Saddle Point occurs when Maximin and Minimax values are equal.
- A Zero-Sum Game is one in which one player's gain equals the other player's loss.
- Dominance is used to reduce the size of a game matrix.
Part B – Important 5-Mark Questions
- Solve a two-machine sequencing problem involving 5 to 9 jobs using Johnson's Rule. Find the optimal sequence, total elapsed time and idle time.
- Find the value of the game for the following payoff matrix:
| B1 | B2 | |
|---|---|---|
| A1 | 5 | 1 |
| A2 | 3 | 4 |
- Explain the features and characteristics of Game Theory.
- Discuss the applications of Sequencing.
- Explain the assumptions involved in Sequencing Problems.
- Discuss the merits and demerits of Game Theory.
Part C – Important 8-Mark Questions
- Solve the following three-machine sequencing problem using Johnson's Rule.
| Job | Machine 1 | Machine 2 | Machine 3 |
|---|---|---|---|
| A | 3 | 4 | 6 |
| B | 8 | 3 | 7 |
| C | 7 | 2 | 5 |
| D | 4 | 5 | 11 |
| E | 9 | 1 | 5 |
| F | 8 | 4 | 6 |
| G | 7 | 3 | 12 |
- Solve a 2 × 4 Game Theory problem using the Graphical Method.
- Solve a 2 × 3 Game Theory problem using the Graphical Method.
- Solve a 3 × 3 Game Theory problem using the Dominance Method.
- Explain the different methods of Game Theory.
- Discuss the rules and procedures involved in solving Game Theory problems.
Solved Example – Johnson's Rule
Problem: Five jobs must be processed through two machines.
| Job | Machine 1 | Machine 2 |
|---|---|---|
| A | 3 | 6 |
| B | 8 | 3 |
| C | 7 | 5 |
| D | 4 | 2 |
| E | 9 | 4 |
Step 1: Identify the smallest processing time. The smallest time is 2, belonging to Job D on Machine 2. Place Job D last.
Step 2: The next smallest time is 3. Job A has 3 on Machine 1, so place it first. Job B has 3 on Machine 2, so place it in the latest available position.
Continue the procedure.
One optimal sequence is A – C – E – B – D.
Step 3: Prepare the time schedule.
| Job | Machine 1 Completion | Machine 2 Start | Machine 2 Completion |
|---|---|---|---|
| A | 3 | 3 | 9 |
| C | 10 | 10 | 15 |
| E | 19 | 19 | 23 |
| B | 27 | 27 | 30 |
| D | 31 | 31 | 33 |
Optimal sequence = A – C – E – B – D.
Total elapsed time = 33 time units.
Machine 1 idle time = 2 time units.
Machine 2 idle time = 13 time units over the total schedule.
Important Three-Machine Rule: The reduction method can be applied if either minimum M1 ≥ maximum M2 or minimum M3 ≥ maximum M2.
Then construct two fictitious machines:
Apply Johnson's Rule to the two fictitious machines.
For the A–G problem above, the condition is satisfied because minimum Machine 3 time is 5 and maximum Machine 2 time is 5.
UNIT 4 – NETWORK ANALYSIS, PERT AND CPM (CO4)
Part A – Important 1-Mark Questions
- Critical Path determines the minimum project completion time.
- CPM is a deterministic technique.
- PERT is a probabilistic technique.
- PERT uses three time estimates: optimistic, most likely and pessimistic.
- An event is represented by a circle.
- An activity is represented by an arrow.
- Network Analysis helps in planning, scheduling and controlling project activities.
Part B – Important 5-Mark Questions
- Draw a network diagram for the activities 1–2 (5), 1–3 (6), 1–4 (3), followed by the remaining activities up to 8–9 as given in the question.
- Draw a network diagram using a precedence table involving activities A to J.
- Solve a 3 × 3 Assignment Problem using the Hungarian Method.
- Differentiate between PERT and CPM.
- Explain the limitations of CPM.
- Discuss the objectives of Network Analysis.
Part C – Important 8-Mark Questions
- Draw a network diagram and determine the Critical Path and project duration from given precedence relationships.
- Calculate expected time and variance using PERT.
- Calculate earliest start, earliest finish, latest start and latest finish times.
- Calculate total float, free float and slack.
- Solve an Assignment Problem involving a dummy row or column.
- Explain the objectives of Network Analysis.
- Differentiate between PERT and CPM.
- Explain important Network Analysis terminology.
Solved Example – Critical Path Method
Problem: Consider the following project activities.
| Activity | Duration |
|---|---|
| A (1–2) | 3 |
| B (1–3) | 2 |
| C (2–4) | 4 |
| D (3–4) | 3 |
| E (4–5) | 2 |
Step 1: Identify the possible paths.
Path 1: A → C → E.
Duration = 3 + 4 + 2 = 9.
Path 2: B → D → E.
Duration = 2 + 3 + 2 = 7.
Step 2: Compare the path durations.
| Path | Duration |
|---|---|
| A – C – E | 9 |
| B – D – E | 7 |
Critical Path = A – C – E.
Minimum project completion time = 9 time units.
Important PERT Formula Example
Suppose:
- Optimistic time (a) = 2 days.
- Most likely time (m) = 5 days.
- Pessimistic time (b) = 8 days.
Expected time:
te = (2 + 4 × 5 + 8) / 6 = 30 / 6.
Expected time = 5 days.
Variance:
σ² = [(8 − 2) / 6]² = 1.
Variance = 1 day².
UNIT 5 – DECISION THEORY AND QUEUING THEORY (CO5)
Part A – Important 1-Mark Questions
- A Decision Tree is a tree diagram.
- A square represents a Decision Node.
- A circle represents a Chance Node.
- Queuing Theory is the study of waiting lines.
- In an M/M/1 model, service times follow an exponential distribution.
- Decision Trees are used for decision-making under uncertainty.
- Utilisation factor is represented by ρ.
Part B – Important 5-Mark Questions
- Calculate mean waiting time in the queue for an M/M/1 model where arrival rate λ = 25 customers per hour and mean service time is 120 seconds.
- Calculate the utilisation factor for a bank where λ = 10 and μ = 12 customers per hour.
- Draw a Decision Tree for a launch/not-launch decision and calculate Expected Monetary Value (EMV).
- Solve a decision problem involving a risky contract and a diversified portfolio.
- Solve a Queuing Theory problem involving a TV repairman or self-service store.
- Explain the components and advantages of a Decision Tree.
- Explain waiting time cost and idle time cost.
- Discuss the applications of Queuing Theory.
Part C – Important 8-Mark Questions
- Solve the following single-channel Queuing Theory problem: Arrival rate λ = 20 customers per hour and service rate μ = 24 customers per hour. Calculate P0, Ls, Ws, Lq and Wq.
- Solve a Queuing Theory problem with limited waiting space where λ = 6 and μ = 12 customers per hour. Find steady-state probabilities and average waiting time using the given system capacity.
- Solve the Decision Tree problem involving Mr. Sinha's well drilling.
- Solve a decision-making problem involving company R1, R2 and royalty-based research.
- Explain the procedure for applying Queuing Models.
- Discuss the structure and components of a Queuing System.
Solved Example – M/M/1 Queuing Model
Problem:
Arrival rate λ = 20 customers per hour.
Service rate μ = 24 customers per hour.
Calculate P0, Ls, Ws, Lq and Wq.
Step 1: Calculate utilisation factor.
Step 2: Calculate probability of zero customers.
Step 3: Calculate average number of customers in the system.
Step 4: Calculate average number of customers in the queue.
Step 5: Calculate average time spent in the system.
Step 6: Calculate average waiting time in the queue.
| Measurement | Answer |
|---|---|
| P0 | 0.1667 |
| Ls | 5 customers |
| Lq | 4.167 customers |
| Ws | 15 minutes |
| Wq | 12.5 minutes |
IMPORTANT OPERATIONS RESEARCH FORMULAS
1. Queuing Theory – M/M/1
Let λ = Arrival Rate, μ = Service Rate and ρ = Utilisation Factor.
Important: These basic formulas apply to a stable M/M/1 system with λ less than μ and unlimited waiting capacity.
2. PERT Formulas
- a = Optimistic Time.
- m = Most Likely Time.
- b = Pessimistic Time.
3. Johnson's Rule
- Identify the smallest processing time.
- If it belongs to Machine 1, schedule that job first.
- If it belongs to Machine 2, schedule that job last.
- Remove the selected job and repeat.
4. Transportation Problem
Balanced Transportation Problem: Total Supply = Total Demand.
5. Game Theory
MOST IMPORTANT QUESTIONS FOR NOVEMBER 2026 EXAMINATION
| Unit | High-Priority Topics |
|---|---|
| Unit 1 | Graphical Method, Simplex Method, Big-M Method, LPP Formulation |
| Unit 2 | North-West Corner, Least Cost, VAM, MODI, Hungarian Method |
| Unit 3 | Johnson's Rule, Three-Machine Sequencing, Game Theory |
| Unit 4 | Critical Path, PERT, CPM, Network Diagram, Float |
| Unit 5 | M/M/1 Queuing Model, Decision Tree, EMV |
IMPORTANT THEORY QUESTIONS FOR 5 MARKS
- Benefits and advantages of Operations Research.
- Characteristics of Linear Programming Problem.
- Phases of Operations Research.
- Transportation Problem versus Assignment Problem.
- Methods of finding an Initial Basic Feasible Solution.
- Steps involved in the Hungarian Method.
- Characteristics of Game Theory.
- PERT versus CPM.
- Limitations of CPM.
- Components and advantages of Decision Trees.
- Applications of Queuing Theory.
LAST-MINUTE EXAMINATION PREPARATION TIPS
- Practise numerical problems from Units 2, 3, 4 and 5 first.
- Learn the steps of North-West Corner, Least Cost, VAM and MODI.
- Practise two-machine and three-machine sequencing.
- Learn Critical Path calculations and PERT formulas.
- Memorise all important Queuing Theory formulas.
- Prepare PERT versus CPM and Transportation versus Assignment differences.
- Practise the Hungarian Method.
- Prepare at least one important numerical problem from every unit.
- Do not completely skip any unit.
- Show all calculation steps clearly in the examination.
PREVIOUS QUESTION PAPERS – HOW TO PREPARE
Previous examination papers are useful for understanding question patterns and identifying recurring topics.
Students should practise available papers from:
- November 2023.
- April 2025.
- April 2026.
Compare the questions with the topics listed in this article. Pay special attention to repeated numerical problem types.
FREQUENTLY ASKED QUESTIONS
1. Which subject is covered in this study material?
This article covers Operations Research for Manonmaniam Sundaranar University M.Com First Year First Semester.
2. How many units are included in Operations Research?
This study guide covers all five units.
3. Which units should receive more numerical practice?
Units 2, 3, 4 and 5 contain several important numerical problem types. Unit 1 should also be prepared thoroughly.
4. Is the Simplex Method important?
Yes. The Simplex Method is an important numerical topic in Unit 1.
5. Which formulas should students memorise?
Students should memorise M/M/1 Queuing Theory formulas, PERT formulas and Johnson's Rule.
6. Are these questions guaranteed to appear in the examination?
No. These are important revision questions and practice topics. Students should also prepare the complete prescribed syllabus.
CONCLUSION
The above Manonmaniam Sundaranar University M.Com 1st Year 1st Semester Operations Research Important Questions for November 2026 are prepared to help students revise all five units systematically.
Students are advised to practise the solved numerical examples, understand the formulas and prepare the important theoretical questions before the semester examination.
Regular practice and proper time management will help students improve their examination preparation.
All the best for your November 2026 Semester Examinations!
For more university study materials, important questions, previous question papers and examination updates, keep visiting:
MH EDUCATIONAL BLOG
https://www.mheducationalblog.in/
Study Smart – Prepare Well – Achieve Success!
Content Information
Subject: Operations Research
Course: M.Com
Year: First Year
Semester: First Semester
University: Manonmaniam Sundaranar University
Examination: November 2026
Material: Important Questions, Solved Problems and Formulas
Published by: MH Educational Blog