SECTION A – Explanation
Section A of the Operation Research paper is designed to test the student’s basic understanding of fundamental OR concepts and terminology. All questions in this section are compulsory and require short but accurate answers. The examiner expects students to demonstrate clarity of definitions and awareness of core ideas that are repeatedly used throughout the subject.
The questions in this section cover important introductory concepts such as slack and surplus variables, linear programming, different costs involved in inventory problems, basic characteristics of a queuing system, assumptions made in game theory, difference between individual and group replacement, and advantages and limitations of linear programming problems. These concepts form the foundation of Operation Research and are essential for solving numerical and application-based problems in later sections.
For example, questions on slack and surplus variables test understanding of constraint conversion in linear programming. Inventory cost questions check whether students can identify ordering, holding, and shortage costs. Queuing system characteristics examine familiarity with arrival rates, service rates, and queue discipline. Answers in this section should be brief, precise, and written using correct OR terminology. Lengthy explanations are not required, but conceptual errors can easily reduce marks.
SECTION B – Explanation
Section B evaluates the student’s conceptual clarity, analytical thinking, and ability to solve moderate-level OR problems. Students are required to attempt any three questions, allowing them to choose questions based on their strengths. The questions in this section are a mix of theory and numerical problems.
The topics in Section B include the scope and application areas of Operation Research, inventory models with shortages, project scheduling using CPM where earliest and latest times are calculated, replacement of items that deteriorate with and without time value of money, and notes on the augmenting path algorithm used in network flow problems. These questions require students to explain concepts clearly or apply formulas step by step.
For example, the inventory problem requires students to determine optimal production size and frequency by applying inventory control formulas. The project scheduling question tests understanding of network analysis by calculating earliest start, earliest finish, latest start, and latest finish times.
Replacement theory questions examine understanding of economic life of equipment under different financial assumptions. Answers in Section B should be written in a logical flow, beginning with concept explanation followed by calculations where required. The expected length is about one and a half to two pages per question, with neat presentation and clear steps.
SECTION C – Explanation
Section C is the most important and highest-weight section of the Operation Research paper. This section tests the student’s in-depth understanding, numerical ability, and application of OR techniques to real-life problems. Each question provides internal choices, and students must attempt only one part from each question.
The questions in Section C cover advanced and application-oriented topics such as transportation problems solved using Vogel’s Approximation Method and MODI optimality test, queuing theory problems involving finite capacity systems, game theory problems involving zero-sum two-person games, sequencing problems using Johnson’s rule, PERT method with project variance and expected time, replacement decisions under time value of money, formulation of linear programming problems using graphical method, and solving LPPs using simplex method.
For example, the transportation problem requires students to first obtain an initial feasible solution using VAM and then test for optimality using MODI. Queuing problems test understanding of probability concepts such as idle probability and waiting probability. Sequencing problems require correct application of scheduling rules to minimize total elapsed time. Linear programming questions test both formulation skills and solution techniques. Answers in this section should be detailed, systematic, and well structured, usually extending over two to three pages. This section plays a major role in determining the final score.
Overall Understanding of the Paper Pattern
The Operation Research (RME-075) question paper is structured to assess students progressively from basic knowledge to advanced application skills. Section A focuses on fundamental definitions and concepts, Section B tests conceptual clarity and moderate-level problem solving, and Section C evaluates deep understanding and application of OR techniques through numerical problems. Students who understand this structure can prepare effectively by revising definitions for Section A, practicing standard models for Section B, and mastering numerical and application-based problems for Section C.
A strong preparation strategy includes practicing transportation, queuing, sequencing, inventory, and linear programming problems regularly. Special emphasis should be given to Section C topics, as they carry the highest weight and directly influence overall performance.
