1. Operations research analysts do not
A. predict future operations
B. build more than one model
C. collect relevant data
D. recommend decision and accept
Answer
A. predict future operations
2. Decision variables are
A. controllable
B. uncontrollable
C. parameters
D. none of the above
Answer
A. controllable
3. A model is
A. an essence of reality
B. an approximation
C. an idealization’
D. all of the above
Answer
D. all of the above
4. A physical model is an example of
A. an iconic model
B. an analogue model
C. a verbal model
D. a mathematical model
Answer
A. an iconic model
5. Every mathematical model
A. must be deterministic
B. requires computer aid for solution.
C. represents data in numerical form
D. all of the above
Answer
C. represents data in numerical form
6. Operations research approach is
A. multi disciplinary
B. scientific
C. intuitive
D. all of the above
Answer
A. multi disciplinary
7. An optimization model
A. mathematically provides best decision
B. provides decision with limited context
C. helps in evaluating various alternatives constantly
D. all of the above
Answer
D. all of the above
8. OR provides solution only if the elements are
A. quantified
B. qualified
C. feasible
D. optimal
Answer
A. quantified
9. The name management science is preferred by
A. americans
B. english
C. french
D. latin
Answer
A. americans
10. Operations research is applied
A. military
B. business
C. administration’
D. all of the above
Answer
D. all of the above
11. The application of OR techniques involves ___ approach
A. individual
B. team
C. critical
D. none of the above
Answer
B. team
12. OR techniques helps to find ___ solution
A. feasible
B. non feasible
C. optimal
D. non optimal
Answer
C. optimal
13. Modern scientific management research originated during ___
A. world war ii
B. world war i
C. 1990
D. 1993
Answer
A. world war ii
14. ___ helps management to evaluate alternative course of action for selecting the bestcourse of action
A. operations research
B. quantitative technique
C. management research
D. none of the above
Answer
A. operations research
15. ___ Theory is an important operations research technique to analyze the queuingbehaviour.
A. waiting line
B. net work
C. decision
D. simulation
Answer
A. waiting line
16. ___ is an important Operations research technique to be used for determiningoptimal allocation of limited resources to meet the given objectives.
A. waiting line theory
B. net work analysis
C. decision analysis
D. linear programming
Answer
D. linear programming
17. ___ model involves all forms of diagrams
A. iconic
B. mathematical
C. analogue
D. schematic
Answer
A. iconic
18. An organization chart is an example of
A. iconic
B. mathematical
C. analogue
D. none of the above
Answer
C. analogue
19. ___ Is known as symbolic model
A. iconic
B. mathematical
C. analogue
D. none of the above
Answer
B. mathematical
20. A map indicates roads, highways, towns and the interrelationship is an ___ model
A. iconic
B. mathematical
C. analogue
D. none of the above
Answer
C. analogue
21. ___ models in which the input and output variables follow a probability distribution.
A. iconic
B. mathematical
C. analogue
D. deterministic model
Answer
D. deterministic model
22. ___ Example of probabilistic model
A. game theory
B. charts
C. graphs
D. all the above
Answer
A. game theory
23. ___ is a method of analyzing the current movement of the same variable in an effortto predict the future movement of the same variable.
A. goal programming
B. markov analysis
C. replacement theory
D. queuing theory
Answer
B. markov analysis
24. Constraints in an LP model represent
A. limitations
B. requirements
C. balancing limitation
D. all of the above
Answer
D. all of the above
25. Linear programming is a
A. constraint optimization technique
B. technique for economic allocation of limited resources.
C. mathematical technique
D. all of the above
Answer
D. all of the above
26. A constraint in an LP model restricts
A. value of objective function
B. value of decision variable
C. use of available resource
D. all of the above
Answer
D. all of the above
27. The best use of linear programming technique is to find an optimal use of
A. money
B. man power
C. machine
D. all of the above
Answer
D. all of the above
28. Which of the following as an assumption of an LP model
A. divisibility
B. proportionality
C. additively
D. all of the above
Answer
D. all of the above
29. Most of the constraints in the linear programming problem are expressed as ___
A. equality
B. inequality
C. uncertain
D. all of the above
Answer
B. inequality
30. The graphical method of LP problem uses
A. objective function equation
B. constraint equation
C. linear equations
D. all the above
Answer
D. all the above
31. A feasible solution to a linear programming problem
A. must satisfy all problem constraints simultaneously
B. need not satisfy all constraints
C. must be a corner point of the feasible region
D. must optimize the value of the objective function
Answer
A. must satisfy all problem constraints simultaneously
32. While plotting constraints on a graph paper, terminal points on both axes are connectedby a straight line because
A. the resources are limited in supply
B. the objective function is a linear function
C. the constraints are linear equations or in equalities
D. all of the above
Answer
C. the constraints are linear equations or in equalities
33. Constraints in LP problem are called active if they
A. represent optimal solution
B. at optimality do not consume all the available resources
C. both of (a) and (b)
D. none of the above
Answer
A. represent optimal solution
34. The solution space of a LP problem is unbounded due to
A. an incorrect formulation of the lp model
B. objective function is unbounded
C. neither (a) nor (b)
D. both (a) and (b)
Answer
C. neither (a) nor (b)
35. While solving LP problem graphically, the area bounded by the constraints is called
A. feasible region
B. infeasible region
C. unbounded solution
D. none of the above
Answer
A. feasible region
36. Which of the following is not a category of linear programming problems?
A. resource allocation problem
B. cost benefit trade off problem
C. distribution network problem
D. all of the above are categories of linear programming problems.
Answer
D. all of the above are categories of linear programming problems.
37. A linear programming model does not contain which of the following components?
A. data
B. decisions
C. constraints
D. a spread sheet
Answer
D. a spread sheet
38. Which of the following may not be in a linear programming formulation?
A. <=.
B. >.
C. =.
D. all the above
Answer
B. >.
39. While solving an LP problem infeasibility may be removed by
A. adding another constraint
B. adding another variable
C. removing a constraint
D. removing a variable
Answer
C. removing a constraint
40. Straight lines shown in a linear programming graph indicates
A. objective function
B. constraints
C. points
D. all the above
Answer
B. constraints
