About this question paper
This is the previous year question paper of Mathematics Operations Research (MA, MSc) (Semester 3) conducted by Pt. Ravishankar Shukla University, Raipur (Jan 2021). Practising it helps you understand the exam pattern, important questions and marks distribution of your university.
How to prepare with this paper
- पूरा पेपर एक बार पढ़ें और जो प्रश्न आपको आते हैं उन पर निशान लगाएँ।
- देखें कि हर प्रश्न सिलेबस की किस इकाई से है — जो इकाइयाँ बार-बार आती हैं, वही सबसे ज़रूरी हैं।
- बिना नोट्स देखे 3 घंटे में पेपर हल करें, फिर अपनी किताब से उत्तर मिलाएँ।
- इसी विषय के दूसरे वर्षों के पेपर भी डाउनलोड करें और दोहराए गए प्रश्न ढूँढें।
Questions in this paper (text version)
यह टेक्स्ट मूल PDF से लिया गया है ताकि आप इसे जल्दी पढ़ और खोज सकें। सूत्र, चित्र और हिंदी टेक्स्ट सही न दिखें तो ऊपर दी गई PDF देखें।
MATHEMATICS
(Optional Paper)
Paper Fourth (A)
Time : Three Hours ] [ Maximum Marks : 80
Note : Attempt all Sections as directed.
(Objective/Multiple Choice Questions)
Note : Attempt all questions.
Choose the correct answer :
1. The name Operations Research is first coined in the year :
2. The objectives of Operations Research is :
(a) To find new methods of solving problems
(b) To derive formulas of solving problems
(c) To utilize the services of scientists
3. In L. P. P., if there is no non-negative replacement ratio in a
solution which is sought to be improved, then the solution
(a) Feasible
(b) Infeasible
(c) Degenerate
(d) Unbounded
4. In a maximization L. P. P., if at least one artificial variable is
in the basis, but not at zero level and the coefficient of M in
each of the net evaluation is non-negative, then we have :
(a) Optimum solution
(b) Feasible solution
(d) Unbounded solution
5. If the primal has an unbounded solution, then the dual
has :
(a) Optimal solution
(c) Bounded solution
6. If Dual has a finite optimum solution, then the primal has :
(a) Not have a finite optimum solution
(b) Have only basic feasible solution
7. Identify the statement which is not correct :
(a) Post-optimality analysis is normally carried out after
the optimum solution is reached.
(b) Adding of a new variable may disturb the feasibility of
the current optimum solution.
(c) Adding of a constraint may affect the current optimum
solution.
(d) Deletion of an existing variable may affect the
feasibility of the current optimum solution.
8. Identify the statement which is not correct :
(a) Post-optimality analysis forms an integral part of
formulating a linear programming problem.
be affected if right hand side of the constraint is
changed.
(c) The optimality of the current optimum solution may be
affected if right hand side of the constraint is changed.
(d) The optimality of the current optimum solution may be
affected if the coefficient of the objective function is
changed.
9. In linear programming context, parametric programming is a
technique to :
(a) Investigate the effect of simultaneous changes of all
components of right hand side of constraints and
coefficients of variables in the objective.
10. In case of unbounded variables in bounded variable
algorithm, lower and upper bound of decision variable are :
(a) and respectively
(b) and 0 respectively
(c) 0 and respectively
11. In bounded variable algorithm, if a non-basic variable enters
the basis, its value should :
(a) Exceed its upper bound
(b) Not exceed its upper bound
(c) Exceed its lower bound
12. Identify the statement which is not correct in the context of
bounded variable algorithm :
(a) Lower bound of a decision variable can always be
converted into non-negative decision variable.
(b) Upper bound of a decision variable can always be
converted into non-negative decision variable.
(c) In a L. P. P., if any of the variable is at a positive lower
bound, substitute it out at its lower bound.
13. The total number of allocation in a basic feasible solution of
transportation problem of m × n size is equal to :
14. To solve degeneracy in the transportation problem we have
(a) Put allocation in one of the empty cell as zero.
(b) Put a small element epsilon in any one of the empty
cell.
(c) Allocate the smallest element epsilon in such a cell,
which will not form a closed loop with other loaded
cells.
(d) Allocate the smallest element epsilon in such a cell,
which will form a closed loop with other loaded cells.
15. Assignment Problem is basically a :
(a) Maximization problem
(b) Minimization problem
(c) Transportation problem
16. The assignment problem will have alternate solutions when
total opportunity cost matrix has :
(a) At least one zero in each row and column.
(b) All rows have two zeros.
(c) There is a tie between zero opportunity cost cells.
(d) Two diagonal elements are zeros.
17. Choose the relationship which is not true :
(a) Free float + Independent float = Total float
(b) Free float + Head event slack = Total float
(c) Free float + Interfering float = Total float
18. PERT analysis computes the variance of the total project
completion time as :
(a) The sum of the variances of all activities in the project
(b) The sum of the variances of all activities not the critical
path
(c) The variance of the final activity of the project
(d) The sum of the variances of all activities on the critical
path
19. A dummy activity is required when :
(a) Two or more activities have the same starting events
events
identical starting and ending events
20. Which of the following is not a rule for network
construction ?
(a) A network should have only initial and one terminal
node.
(b) Identical initial and final nodes can identify two
activities.
(c) All activities must be tied into a network. Dangers
must be avoided.
which are absolutely necessary.
(Very Short Answer Type Questions)
Note : Attempt all questions.
1. Define Operations Research.
2. Define Linear programming problem.
5. Define goal programming.
6. Define assignment problem.
7. Define transportation problem.
8. What is the basic object of CPM technique ?
(Short Answer Type Questions)
Note : Attempt all questions.
1. What are the situations, where Operations Research
techniques will be applicable ?
2. Briefly explain the characteristics of Operations Research.
3. Prove that dual to the dual is the primal.
4. Formulate the duel to the following linear programming
problem :
Maximize :
Subject to the constraints :
3xx5 15
5xx2 10
5. Solve the following linear goal programming problem
graphically :
Find x and x so as to :
Minimize :
1 3 4 2 1
3 2 4 3 2 4
and satisfy the goals :
1 1 2 1 1
2 1 2 2 2
The goal have been listed in order of priority.
6. Explain Interior point algorithm.
7. Explain north-west corner rule for transportation problem.
8. What is the differentiate between CPM network and PERT
network ?
(Long Answer Type Questions)
Note : Attempt all questions.
Maximize :
1 2 4
Subject to the constraints :
1 2 3 4
1 2 3 5
1 2 3
Use two-phase simplex method of solve the following
Maximize :
Subject to the constraints :
22xx
3xx4 12
2. Using dual simplex method to solve the following linear
programming problem :
Minimize :
1 2 3
Subject to the constraints :
1 2 3
xx2
1 2 3
Consider the linear programming problem :
Minimize :
1 2 3
Subject to the constraints :
1 2 3
Then
from [6, 4, 24] to [6, 2, 12] on the optimum solution.
3. Using the bounded variable technique, solve the following
linear programming problem :
Maximize :
Subject to the constraints :
1 2 3
xx20
2xx10
08x
04x
x 0.
Consider the parametric linear programming problem :
Maximize :