Download Original PDF
Get the official Barkatullah University print version scanned document.
🤝 Help Your Juniors!
Have previous year question papers that aren't on our website? Help the next batch of students by sending them to us! With your consent, we will proudly feature your name as a Top Contributor on our platform.
Submit Papers 📩EF-465
M.A./M.Sc. IIIrd Semester (Reg./Pvt./ATKT)
Examination, 2021-22
Maths
Operations Research-I
Paper - VIII
Note :- Attempt all questions.
A Graph paper must be given if required.
SECTION - 'A'
Objective Type Questions
Operations research came into existence.
(a) In the year 1940
(b) In the military context
(c) During world war I
(d) During world war II
(a) 1957
(b) 1959
(c) 1940
(d) None of these
(a) O.R. is applied decision theory
(b) O.R. is the art of giving good answers to prob lems which otherwise have best answers.
(c) O.R. is a scientific approach to problems solving for executive management.
(d) O.R. is the science of use variables.
(a) Formulation phase
(b) Judgement phase
(c) Research phase
(d) Action phase
(a) Proportionality
(b) Uncertainty
(c) Additivity
(d) Divisibility
(a) Iconic model
(b) Analogue model
(c) Verbal model
(d) Symbolic model
(a) The graphic approach to the solution of LPP's cannot handle problems with more than three variables.
(b) A feasible solution to an LPP is one that satisfies atleast one of the constraints of the problem.
(c) An optimum solution to an LPP is a feasible solution which optimizes the objective function.
(d) The feasible region is also termed as the solution space
(a) The graphic approach to an LPP is most suitable when there are any two decision variables.
(b) A possible solution on the graph corresponds to every point (x,y)
(c) The graphic approach to an LPP is applicable when the number of decision variable are more than the number of constrients.
(d) The common region that satisfies all the constraints is called the feasible (convex) region.
(a) No feasible solution
(b) Unbounded solution
(c) Unique optimum solution
(d) Multiple optimum solutions
(a) The coefficients of stock variables are zero where as the coefficients of surplus variables are not zero in the objective function.
(b) The coefficients of surplus variables are zero where as the coefficients of stock variables are non zero in the objective function.
(c) The coefficients of stock/surplus variables are always zero in the objective function.
(d) None of these
(a) Zj - Cj ≥ 0
(b) Zj - Cj ≤ 0
(c) Zj - Cj = 0 or Zj - Cj < 0
(d) None of these
(a) Actual coefficients
(b) Zero
(c) -1
(d) None of these
(a) A coefficient in the objective function
(b) A right-hand side constant of a constraint in a dual problem.
(c) An input - output coefficient
(d) None of these
(a) The number of dual constraints is exactly equal to the number of primal variables.
(b) The number of dual variables is exactly equal to the number of primal constraints
(c) The dual of the dual is primal
(d) None of these
(a) Duality does not play any role in the post - opti mal analysis of on LPP.
(b) The optimum simplex table provides informa tion about the status and worth of the resources in addition to the optimum values of the decision variables.
(c) In the optimum solution of a profit maximization LPP, the total (maximum) profit must be equal to the total worth of the resources.
(d) To write the dual problem, it is necessary that its primal LPP must have all its variables as greater than or equal to zero.
SECTION - 'B'
Short Answer Type Questions 5x5=25
OR
Write short note on features of operations research.
OR
Write main characteristics of good model for operations research.
OR
Write major steps in the solution of a linear programming prob lem by graphical method.
SECTION - 'C'
Long Answer Type Questions 9x5=45
OR
Prove that any convex combination of K different optimum solutions to an LPP is again on optimum solution to the prob lem.
OR
Formulate the dual or the following linear programing program-ing problem.
Minimize z = 2x₁ + 3x₂ + 4x₃
Subject to the constrants
OR
Write origin and development of operations research.
Maximize z = 2x₁ + 4x₂
Subject to the constraints
OR
Write short note on infeasible solution. Give one example.
OR
Use two - phase simplex method to maximize z = 5x₁ - 4x₂ + 3x₃, subject to the constraints.
OR
Use duality in solving the LPP:
minimize z = 2x₁ - x₂ + x₃ + 5x₂ - 3x₅
Subject to the constraints.