My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Previous year question hub

Operation Research - Operations research and Operations management - Production & Industrial Engineering Previous Year Questions

Practice Operation Research - Operations research and Operations management - Production & Industrial Engineering previous year questions organised from real papers, with year-wise coverage and clear topic navigation.

21Papers
19Years
66Questions
1Topics

Operation Research question pattern

Every graph below is calculated only from this selection.

Questions by year

Compare question counts across years.

Difficulty distribution

How the classified questions are distributed by difficulty.

Easy 35 53%
Medium 31 47%

Question type distribution

MCQ, numerical, multiple-select and other formats found in these papers.

MCQ 60 90.9%
Numerical Answer Type (NAT) 6 9.1%

Subject weightage

Top subjects by unique question coverage.

Production & Industrial Engineering
66 Qs

Most asked topics

Top topics across the included previous year papers.

Operations research and Operations management
66 Qs

Subtopic coverage

Top subtopics inside this exact selection.

Operation Research
66 Qs

Paper coverage

Question coverage for the most populated papers. Every active PYP paper remains listed below.

Production and Industrial Engineering (PI) 2026
4 Qs
Production & Industrial Engineering (PI) 2025
2 Qs
Production & Industrial Engineering (PI) 2024
3 Qs
Production & Industrial Engineering (PI) 2023
1 Qs
Production & Industrial Engineering (PI) 2022
3 Qs
Production & Industrial Engineering (PI) 2021
1 Qs
Production & Industrial Engineering (PI) 2020
2 Qs
Production & Industrial Engineering (PI) 2019
2 Qs
Production & Industrial Engineering (PI) 2018
2 Qs
Production & Industrial Engineering (PI) 2017
1 Qs
Production & Industrial Engineering (PI) 2016
2 Qs
Production & Industrial Engineering (PI) 2014
2 Qs
Production & Industrial Engineering (PI) 2013 [Session 2]
4 Qs
Production & Industrial Engineering (PI) 2013 [Session 4]
4 Qs
Production & Industrial Engineering (PI) 2013 [Session 1]
3 Qs
Production & Industrial Engineering (PI) 2012
3 Qs
Production & Industrial Engineering (PI) 2011
2 Qs
Production & Industrial Engineering (PI) 2010
4 Qs
Production & Industrial Engineering (PI) 2009
6 Qs
Production & Industrial Engineering (PI) 2008
4 Qs
Production & Industrial Engineering (PI) 2007
11 Qs

Included previous year papers

Newest papers appear first. Search these papers or sort by year and name.

Paper nameYearPDFAttempt
Production and Industrial Engineering (PI) 20262026
4 questions in this view
2026
Production & Industrial Engineering (PI) 20252025
2 questions in this view
2025
Production & Industrial Engineering (PI) 20242024
3 questions in this view
2024
Production & Industrial Engineering (PI) 20232023
1 questions in this view
2023
Production & Industrial Engineering (PI) 20222022
3 questions in this view
2022
Production & Industrial Engineering (PI) 20212021
1 questions in this view
2021
Production & Industrial Engineering (PI) 20202020
2 questions in this view
2020
Production & Industrial Engineering (PI) 20192019
2 questions in this view
2019
Production & Industrial Engineering (PI) 20182018
2 questions in this view
2018
Production & Industrial Engineering (PI) 20172017
1 questions in this view
2017
Production & Industrial Engineering (PI) 20162016
2 questions in this view
2016
Production & Industrial Engineering (PI) 20142014
2 questions in this view
2014
Production & Industrial Engineering (PI) 2013 [Session 1]2013
3 questions in this view
2013
Production & Industrial Engineering (PI) 2013 [Session 2]2013
4 questions in this view
2013
Production & Industrial Engineering (PI) 2013 [Session 4]2013
4 questions in this view
2013
Production & Industrial Engineering (PI) 20122012
3 questions in this view
2012
Production & Industrial Engineering (PI) 20112011
2 questions in this view
2011
Production & Industrial Engineering (PI) 20102010
4 questions in this view
2010
Production & Industrial Engineering (PI) 20092009
6 questions in this view
2009
Production & Industrial Engineering (PI) 20082008
4 questions in this view
2008
Production & Industrial Engineering (PI) 20072007
11 questions in this view
2007

All Operation Research previous year questions

Practice every matching question in batches of 20, with every available option.

1
2007 · Production & Industrial Engineering · Operations research and Operations management · Operation Research
Production & Industrial Engineering (PI) 2007
In queueing models, M/M/c denotes a Poisson arrival process and
Open complete paper
2
2007 · Production & Industrial Engineering · Operations research and Operations management · Operation Research
Production & Industrial Engineering (PI) 2007
In sensitivity analysis of LP models, which of the following holds true?
P – Reduced cost of basic variables are zero at optimality
Q – Constraints are binding when shadow prices are non-zero
R – Constraints are binding when shadow prices are zero
S – Reduced cost is same as shadow price
Open complete paper
3
2007 · Production & Industrial Engineering · Operations research and Operations management · Operation Research
Production & Industrial Engineering (PI) 2007
Consider the symmetric dual pair of LPs [P] and [D], where A is an \( m \times n \) matrix, b is an \( m \)-vector and c is an \( n \)-vector.
\[ [P] \quad \text{Min} \quad c^T x \\ \text{s.t.} \quad Ax \ge b \\ x \ge 0 \] \[ [D] \quad \text{Max} \quad b^T y \\ \text{s.t.} \quad A^T y \le c^T \\ y \ge 0 \]
Assume that [P] is feasible. If the optimal values are \( z_1^* \) for [P] and \( z_2^* \) for [D], whenever they exist, then which one of the following is true?
Open complete paper
4
2007 · Production & Industrial Engineering · Operations research and Operations management · Operation Research
Production & Industrial Engineering (PI) 2007
In an optimization problem, let \( y \) be a 0–1 variable and \( x \) be a positive real number. Now, the condition that \( x \) can take non-zero values only if \( y = 1 \) can be modeled using the linear constraint
Open complete paper
5
2007 · Production & Industrial Engineering · Operations research and Operations management · Operation Research
Production & Industrial Engineering (PI) 2007
Karmarkar’s algorithm for Linear Programming
Open complete paper
6
2007 · Production & Industrial Engineering · Operations research and Operations management · Operation Research
Production & Industrial Engineering (PI) 2007
Consider the symmetric dual pair of LPs [P] and [D], where A is an m×n matrix, b is an m-vector and c is an n-vector.
[P] Min c^T x s.t. Ax ≥ b, x ≥ 0
[D] Max b^T y s.t. A^T y ≤ c^T, y ≥ 0
Assume that [P] is feasible. If the optimal values are z_1^* for [P] and z_2^* for [D], whenever they exist, then which one of the following is true?
Open complete paper
7
2007 · Production & Industrial Engineering · Operations research and Operations management · Operation Research
Production & Industrial Engineering (PI) 2007
In an optimization problem, let y be a 0–1 variable and x be a positive real number. Now, the condition that x can take non-zero values only if y = 1 can be modeled using the linear constraint
Open complete paper
8
2007 · Production & Industrial Engineering · Operations research and Operations management · Operation Research
Production & Industrial Engineering (PI) 2007
For a transportation problem that has a feasible solution, the northwest corner rule gives a possible solution which is
Open complete paper
9
2007 · Production & Industrial Engineering · Operations research and Operations management · Operation Research
Production & Industrial Engineering (PI) 2007
The assignment problem in Linear Programming is also an example of a discrete optimization problem. How many feasible solutions are there to this problem defined on n jobs and n persons?
Open complete paper
10
2008 · Production & Industrial Engineering · Operations research and Operations management · Operation Research
Production & Industrial Engineering (PI) 2008
Customers arrive at a service counter manned by a single person according to a Poisson distribution with a mean arrival rate of 30 per hour. The time required to serve a customer follows an exponential distribution with a mean of 100 seconds. The average waiting time (in hours) of a customer in the system will be
Open complete paper
11
2008 · Production & Industrial Engineering · Operations research and Operations management · Operation Research
Production & Industrial Engineering (PI) 2008
Consider the following linear programming problem (LPP): \[\begin{aligned} \text{Maximize } z &= 5x_1 + 3x_2 \\ \text{Subject to the following constraints} \\ x_1 - x_2 &\leq 2 \\ x_1 + x_2 &\geq 3 \\ x_1, x_2 &\geq 0 \end{aligned}\] The above LPP has
Open complete paper
12
2008 · Production & Industrial Engineering · Operations research and Operations management · Operation Research
Production & Industrial Engineering (PI) 2008
Consider the following linear programming problem (LPP): \( \text{Maximize } z = 5x_1 + 3x_2 \) Subject to the following constraints \( x_1 - x_2 \leq 2 \) \( x_1 + x_2 \geq 3 \) \( x_1, x_2 \geq 0 \) The above LPP has
Open complete paper
13
2009 · Production & Industrial Engineering · Operations research and Operations management · Operation Research
Production & Industrial Engineering (PI) 2009
As per Kendall’s notation in M/G/c queuing system, the number of arrivals in a fixed time follows
Open complete paper
14
2009 · Production & Industrial Engineering · Operations research and Operations management · Operation Research
Production & Industrial Engineering (PI) 2009
As per Kendall's notation in M/G/c queuing system, the number of arrivals in a fixed time follows
Open complete paper
15
2009 · Production & Industrial Engineering · Operations research and Operations management · Operation Research
Production & Industrial Engineering (PI) 2009
Basic variables in the optimal solution are
Open complete paper
16
2009 · Production & Industrial Engineering · Operations research and Operations management · Operation Research
Production & Industrial Engineering (PI) 2009
Suppose that in the LPP given, the right hand side of constraint 1 changes from 50 to 40. The new objective value is
Open complete paper
17
2010 · Production & Industrial Engineering · Operations research and Operations management · Operation Research
Production & Industrial Engineering (PI) 2010
Apart from the non-negativity criteria, the dual problem for the given Linear Programming problem consists of
Open complete paper
18
2010 · Production & Industrial Engineering · Operations research and Operations management · Operation Research
Production & Industrial Engineering (PI) 2010
The value of the objective function after solving the dual problem is
Open complete paper
19
2011 · Production & Industrial Engineering · Operations research and Operations management · Operation Research
Production & Industrial Engineering (PI) 2011
A dedicated machine receives jobs at a rate of 20 per hour and the processing rate of the machine is 30 jobs per hour. Assume the following:
(i) inter-arrival time and processing time for jobs follow exponential distributions
(ii) queue discipline is first-come-first-served (FCFS)
(iii) queue capacity and job population are infinite
For how much time (in minutes), on an average, does a job have to wait before it gets loaded on to the machine?
Open complete paper
20
2011 · Production & Industrial Engineering · Operations research and Operations management · Operation Research
Production & Industrial Engineering (PI) 2011
A transporter receives the same number of orders each day. Currently, he has some pending orders (backlog) to be shipped. If he uses 7 trucks, then at the end of the 4th day he can clear all the orders. Alternatively, if he uses only 3 trucks, then all the orders are cleared at the end of the 10th day. What is the minimum number of trucks required so that there will be no pending order at the end of the 5th day?
Open complete paper

Showing 20 of 54 questions