Multiple Choice Questions Decision Science

MULTIPLE CHOICE QUESTIONS
DECISION SCIENCE
1. Decision Science approach is

a. Multi-disciplinary
b. Scientific
c. Intuitive
d. All of the above
2. For analyzing a problem, decision-makers should study
a. Its qualitative aspects
b. Its quantitative aspects
c. Both a & b
d. Neither a nor b
3. Decision variables are
a. Controllable
b. Uncontrollable
c. Parameters
d. None of the above
4. A model is
a. An essence of reality
b. An approximation
c. An idealization
d. All of the above
5. Managerial decisions are based on
a. An evaluation of quantitative data
b. The use of qualitative factors
c. Results generated by formal models
d. All of the above
6. The use of decision models
a. Is possible when the variables value is known
b. Reduces the scope of judgement & intuition known with certainty in decision-making
c. Require the use of computer software
7. Every mathematical model
a. Must be deterministic
b. Requires computer aid for its solution
c. Represents data in numerical form
d. All of the above
8. A physical model is example of
a. An iconic model
b. An analogue model
c. A verbal model
d. A mathematical model
9. An optimization model
a. Provides the best decision
b. Provides decision within its limited context
c. Helps in evaluating various alternatives
d. All of the above
10. The quantitative approach to decision analysis is a
a. Logical approach
b. Rational approach
c. Scientific approach
d. All of the above
11. The qualitative approach to decision analysis relies on
a. Experience
b. Judgement
c. Intuition
d. All of the above
12. The mathematical model of an LP problem is important because
a. It helps in converting the verbal description & numerical data into mathematical expression
b. Decision-makers prefer to work with formal models
c. It captures the relevant relationship among decision factors
d. It enables the use of algebraic technique
13. Linear programming is a
a. Constrained optimization technique
b. Technique for economic allocation of limited resources
c. Mathematical technique
d. All of the above
14. A constraint in an LP model restricts
a. Value of objective function
b. Value of a decision variable
c. Use of the available resources
d. All of the above
15. The distinguishing feature of an LP model is
a. Relationship among all variables is linear
b. It has single objective function & constraints
c. Value of decision variables is non-negative
d. All of the above
16. Constraints in an LP model represents
a. Limitations
b. Requirements
c. Balancing limitations & requirements
d. All of the above
17. Non-negativity condition is an important component of LP model because
a. Variables value should remain under the control of the decision-maker
b. Value of variables make sense & correspond to real-world problems
c. Variables are interrelated in terms of limited resources
18. Before formulating a formal LP model, it is better to
a. Express each constrain in words
b. Express the objective function in words
c. Verbally identify decision variables
d. All of the above
19. Maximization of objective function in an LP model means
a. Value occurs at allowable set of decisions
b. Highest value is chosen among allowable decisions
c. Neither of above
d. Both a & b
20. Which of the following is not a characteristic of the LP model
a. Alternative courses of action
b. An objective function of maximization type
c. Limited amount of resources
d. Non-negativity condition on the value of decision variables.
21. The best use of linear programming technique is to find an optimal use of
a. Money
b. Manpower
c. Machine
d. All of the above
22. Which of the following is not a characteristic of the LP
a. Resources must be limited
b. Only one objective function
c. Parameters value remains constant during the planning period
d. The problem must be of minimization type
23. Non-negativity condition in an LP model implies
a. A positive coefficient of variables in objective function
b. A positive coefficient of variables in any constraint
c. Non-negative value of resources
24. Which of the following is an assumption of an LP model
a. Divisibility
b. Proportionality
c. Additivity
d. All of the above
25. Which of the following is a limitation associated with an LP model
a. The relationship among decision variables in linear
b. No guarantee to get integer valued solutions
c. No consideration of effect of time & uncertainty on LP model
d. All of the above
26. The graphical method of LP problem uses
a. Objective function equation
b. Constraint equations
c. Linear equations
d. All of the above
27. A feasible solution to an LP problem
a. Must satisfy all of the problem’s constraints simultaneously
b. Need not satisfy all of the constraints, only some of them
c. Must be a corner point of the feasible region
d. Must optimize the value of the objective function
28. Which of the following statements is true with respect to the optimal solution of an LP problem
a. Every LP problem has an optimal solution
b. Optimal solution of an LP problem always occurs at an extreme point
c. At optimal solution all resources are completely used
d. If an optimal solution exists, there will always be at least one at a corner
29. An iso-profit line represents
a. An infinite number of solutions all of which yield the same profit
b. An infinite number of solution all of which yield the same cost
c. An infinite number of optimal solutions
d. A boundary of the feasible region
30. If an iso-profit line yielding the optimal solution coincides with a constaint line, then
a. The solution is unbounded
b. The solution is infeasible
c. The constraint which coincides is redundant
31. While plotting constraints on a graph paper, terminal points on both the axes are connected by
a straight line because
a. The resources are limited in supply
b. The objective function as a linear function
c. The constraints are linear equations or inequalities
d. All of the above
32. A constraint in an LP model becomes redundant because
a. Two iso-profit line may be parallel to each other
b. The solution is unbounded
c. This constraint is not satisfied by the solution values
33. If two constraints do not intersect in the positive quadrant of the graph, then
a. The problem is infeasible
b. The solution is unbounded
c. One of the constraints is redundant
34. 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 a & b
35. The solution space (region) of an 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 & b
36. While solving a LP model graphically, the area bounded by the constraints is called
a. Feasible region
b. Infeasible region
c. Unbounded solution
37. Alternative solutions exist of an LP model when
a. One of the constraints is redundant
b. Objective function equation is parallel to one of the constraints
c. Two constraints are parallel
d. All of the above
38. While solving a LP problem, infeasibility may be removed by
a. Adding another constraint
b. Adding another variable
c. Removing a constraint
d. Removing a variable
39. If a non-redundant constraint is removed from an LP problem then
a. Feasible region will become larger
b. Feasible region will become smaller
c. Solution will become infeasible
40. If one of the constraint of an equation in an LP problem has an unbounded solution, then
a. Solution to such LP problem must be degenerate
b. Feasible region should have a line segment
c. Alternative solutions exist
41. The initial solution of a transportation problem can be obtained by applying any known method.
However, the only condition is that
a. The solution be optimal
b. The rim conditions are satisfied
c. The solution not be degenerate
d. All of the above
42. The dummy source or destination in a transportation problem is added to
a. Satisfy rim conditions
b. Prevent solution from becoming degenerate
c. Ensure that total cost does not exceed a limit
43. The occurrence of degeneracy while solving a transportation problem means that
a. Total supply equals total demand
b. The solution so obtained is not feasible
c. The few allocations become negative
44. An alternative optimal solution to a minimization transportation problem exists whenever
opportunity cost corresponding to unused route of transportation is:
a. Positive & greater than zero
b. Positive with at least one equal to zero
c. Negative with at least one equal to zero
45. One disadvantage of using North-West Corner rule to find initial solution to the transportation
problem is that
a. It is complicated to use
b. It does not take into account cost of transportation
c. It leads to a degenerate initial solution
d. All of the above
46. The solution to a transportation problem with ‘m’ rows (supplies) & ‘n’ columns (destination) is
feasible if number of positive allocations are
a. m+n
b. m*n
c. m+n-1
d. m+n+1
47. If an opportunity cost value is used for an unused cell to test optimality, it should be
a. Equal to zero
b. Most negative number
c. Most positive number
d. Any value
48. During an iteration while moving from one solution to the next, degeneracy may occur when
a. The closed path indicates a diagonal move
b. Two or more occupied cells are on the closed path but neither of them represents a corner
of the path.
c. Two or more occupied cells on the closed path with minus sign are tied for lowest circled
value
d. Either of the above
49. The large negative opportunity cost value in an unused cell in a transportation table is chosen to
improve the current solution because
a. It represents per unit cost reduction
b. It represents per unit cost improvement
c. It ensure no rim requirement violation
50. The smallest quantity is chosen at the corners of the closed path with negative sign to be
assigned at unused cell because
a. It improve the total cost
b. It does not disturb rim conditions
c. It ensure feasible solution
d. All of the above
51. When total supply is equal to total demand in a transportation problem, the problem is said to
be
a. Balanced
b. Unbalanced
c. Degenerate
52. Which of the following methods is used to verify the optimality of the current solution of the
transportation problem
a. Least cost method
b. Vogel’s approximation method
c. Modified distribution method
d. All of the above
53. The degeneracy in the transportation problem indicates that
a. Dummy allocation(s) needs to be added
b. The problem has no feasible solution
c. The multiple optimal solution exist
d. a & b but not c
54. An assignment problem is considered as a particular case of a transportation problem because
a. The number of rows equals columns
b. All xij = 0 or 1
c. All rim conditions are 1
d. All of the above
55. An optimal assignment requires that the maximum number of lines that can be drawn through
squares with zero opportunity cost be equal to the number of
a. Rows or columns
b. Rows & columns
c. Rows + columns – 1
56. While solving an assignment problem, an activity is assigned to a resource through a square with
zero opportunity cost because the objective is to
a. Minimize total cost of assignment
b. Reduce the cost of assignment to zero
c. Reduce the cost of that particular assignment to zero
d. All of the above
57. The method used for solving an assignment problem is called
a. Reduced matrix method
b. MODI method
c. Hungarian method
58. The purpose of a dummy row or column in an assignment problem is to
a. Obtain balance between total activities & total resources
b. Prevent a solution from becoming degenerate
c. Provide a means of representing a dummy problem
59. Maximization assignment problem is transformed into a minimization problem by
a. Adding each entry in a column from the maximization value in that column
b. Subtracting each entry in a column from the maximum value in that column
c. Subtracting each entry in the table from the maximum value in that table
d. Any one of the above
60. If there were n workers & n jobs there would be
a. n! solutions
b. (n-1)! solutions
c. (n!)n solutions
d. n solutions
61. An assignment problem can be solved by
a. Simplex method
b. Transportation method
c. Both a & b
62. For a salesman who has to visit n cities which of the following are the ways of his tour plan
a. n!
b. (n+1)!
c. (n-1)!
d. n
63. The assignment problem
a. Requires that only one activity be assigned to each resource
b. Is a special case of transportation problem
c. Can be used to maximize resources
d. All of the above
64. An assignment problem is a special case of transportation problem, where
a. Number of rows equals number of columns
b. All rim conditions are 1
c. Values of each decision variable is either 0 or 1
d. All of the above
65. Every basic feasible solution of a general assignment problem, having a square pay-off matrix of
order, n should have assignments equal to
a. 2n+1
b. 2n-1
c. m+n-1
d. m+n
66. To proceed with the MODI algorithm for solving an assignment problem, the number of dummy
allocations need to be added are
a. n
b. 2n
c. n-1
d. 2n-1
67. The Hungarian method for solving an assignment problem can also be used to solve
a. A transportation problem
b. A travelling salesman problem
c. A LP problem
d. Both a & b
68. An optimal solution of an assignment problem can be obtained only if
a. Each row & column has only one zero element
b. Each row & column has at least one zero element
c. The data is arrangement in a square matrix
69. Customer behavior in which the customer moves from one queue to another in a multiple
channel situation is
a. Balking
b. Reneging
c. Jockeying
d. Altering
70. Which of the following characteristics apply to queuing system
a. Customer population
b. Arrival process
c. Both a & b
d. Neither a nor b
71. Which of the following is not a key operating characteristics apply to queuing system
a. Utilization factor
b. Percent idle time
c. Average time spent waiting in the system & queue
72. Priority queue discipline may be classified as
a. Finite or infinite
b. Limited & unlimited
c. Pre-emptive or non-pre-emptive
d. All of the above
73. The calling population is assumed to be infinite when
a. Arrivals are independent of each other
b. Capacity of the system is infinite
c. Service rate is faster than arrival rate
d. All of the above
74. Which of the cost estimates & performance measures are not used for economic analysis of a
queuing system
a. Cost per server per unit of time
b. Cost per unit of time for a customer waiting in the system
c. Average number of customers in the system
d. Average waiting time of customers in the system
75. A calling population is considered to be infinite when
a. All customers arrive at once
b. Arrivals are independent of each other
c. Arrivals are dependent upon each other
d. All of the above
76. The cost of providing service in a queuing system decreases with
a. Decreased average waiting time in the queue
b. Decreased arrival rate
c. Increased arrival rate
77. Service mechanism in a queuing system is characterized by
a. Server’s behavior
b. Customer’s behavior
c. Customers in the system
d. All of the above
78. Probabilities of occurrence of any state are
a. Collectively exhaustive
b. Mutually exclusive
c. Representing one of the finite numbers of states of nature in the system
d. All of the above
79. In a matrix of transition probability, the probability values should add up to one in each
a. Row
b. Column
c. Diagonal
d. All of the above
80. In a matrix of transition probability, the element aij where i=j is a
a. Gain
b. Loss
c. Retention
81. In Markov analysis, state probabilities must
a. Sum to one
b. Be less than one
c. Be greater than one
82. State transition probabilities in the Markov chain should
a. Sum to 1
b. Be less than 1
c. Be greater than 1
83. If a matrix of transition probability is of the order n*n, then the number of equilibrium
equations would be
a. n
b. n-1
c. n+1
84. In the long run, the state probabilities become 0 & 1
a. In no case
b. In same cases
c. In all cases
d. Cannot say
85. While calculating equilibrium probabilities for a Markov process, it is assumed that
a. There is a single absorbing state
b. Transition probabilities do not change
c. There is a single non-absorbing state
86. The first-order Markov chain is generally used when
a. Transition probabilities are fairly stable
b. Change in transition probabilities is random
c. No sufficient data are available
d. All of the above
87. A problem is classified as Markov chain provided
a. There are finite number of possible states
b. States are collectively exhaustive & mutually exclusive
c. Long-run probabilities of being in a particular state will be constant over time
d. All of the above
88. The transition matrix elements remain positive from one point to the next. This property is
known as:
a. Steady-state property
b. Equilibrium property
c. Regular property
d. All of the above
89. Markov analysis is useful for:
a. Predicting the state of the system at some future time
b. Calculating transition probabilities at some future time
c. All of the above
90. Which of the following is not one of the assumptions of Markov analysis:
a. There are a limited number of possible states
b. A future state can be predicted from the preceding one
c. There are limited number of future periods
d. All of the above
91. An advantage of simulation as opposed to optimization is that
a. Several options of measure of performance can be examined
b. Complex real-life problems can be studied
c. It is applicable in cases where there is an element of randomness in a system
d. All of the above
92. The purpose of using simulation technique is to
a. Imitate a real-world situation
b. Understand properties & operating characteristics of complex real-life problems
c. Reduce the cost of experiment on a model of real situation
d. All of the above
93. Which of the following is not the special purpose simulation language
a. BASIC
b. GPSS
c. GASP
d. SIMSCRIPT
94. As simulation is not an analytical model, therefore the result of simulation must be viewed as
a. Unrealistic
b. Exact
c. Approximation
d. Simplified
95. While assigning random numbers in Monte Carlo simulation, it is
a. Not necessary to assign the exact range of random number interval as the probability
b. Necessary to develop a cumulative probability distribution
c. Necessary to assign the particular appropriate random numbers
d. All of the above
96. Analytical results are taken into consideration before a simulation study so as to
a. Identify suitable values of the system parameters
b. Determine the optimal decision
c. Identify suitable values of decision variables for the specific choices of system parameters
d. All of the above
97. Biased random sampling is made from among alternatives which have
a. Equal probability
b. Unequal probability
c. Probability which do not sum to 1
98. Large complicated simulation models are appreciated because
a. Their average costs are not well-defined
b. It is difficult to create the appropriate events
c. They may be expensive to write and use as an experimental device
d. All of the above
99. Simulation should not be applied in all cases because it
a. Requires considerable talent for model building & extensive computer programming efforts
b. Consumes much computer time
c. Provides at best approximate solution to problem
d. All of the above
100. Simulation is defined as
a. A technique that uses computers
b. An approach for reproducing the processes by which events by chance & changes are created
in a computer
c. A procedure for testing & experimenting on models to answer what if ___, then so & so ___
types of questions
d. All of the above
101. The general purpose system simulation language
a. Requires programme writing
b. Does not require programme writing
c. Requires predefined coding forms
d. Needs a set of equations to describe a system
102. Special simulation languages are useful because they
a. Reduce programme preparation time & cost
b. Have the capability to generate random variables
c. Require no prior programming knowledge
d. All of the above
103. Few causes of simulation analysis failure are
a. Inadequate level of user participation
b. Inappropriate levels of detail
c. Incomplete mix of essential skills
d. All of the above
104. To make simulation more popular, we need to avoid
a. Large cost over runs
b. Prolonged delays
c. User dissatisfaction with simulation results
d. All of the above
105. The important step required for simulation approach in solving a problem is to
a. Test & validate the model
b. Design the experiment
c. Conduct the experiment
d. All of the above
DECISION SCIENCE - ANSWER KEY
1 a 26 d 51 c 76 d 101 b
2 c 27 a 52 a 77 a 102 d
3 a 28 d 53 c 78 d 103 d
4 d 29 a 54 d 79 a 104 d
5 d 30 d 55 d 80 c 105 d
6 d 31 c 56 a 81 a
7 c 32 d 57 c 82 a
8 c 33 a 58 a 83 a
9 a 34 a 59 c 84 c
10 c 35 c 60 a 85 b
11 d 36 a 61 c 86 a
12 a 37 b 62 c 87 d
13 d 38 c 63 d 88 c
14 d 39 a 64 d 89 c
15 a 40 b 65 b 90 c
16 d 41 b 66 c 91 d
17 b 42 a 67 b 92 d
18 d 43 b 68 d 93 a
19 a 44 b 69 c 94 c
20 b 45 b 70 c 95 b
21 d 46 c 71 d 96 c
22 d 47 b 72 c 97 b
23 d 48 c 73 a 98 c
24 d 49 a 74 d 99 d
25 d 50 c 75 b 100 d
Multiple Choice Questions
BCA
IV Sem
OPERATIONS RESEARCH

1. Operations Research (OR) , which is a very powerful tool for ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Research
b) Decision – Making
c) Operations
d) None of the above
2. Who coined the term Operations Research?
a) J.F. McCloskey
b) F.N. Trefethen
c) P.F. Adams
d) Both A and B
3. The term Operations Research was coined in the year ‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) 1950
b) 1940
c) 1978
d) 1960
4. This innovative science of Operations Research was discovered during ‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Civil War
b) World War I
c) World War II
d) Industrial Revolution
5. Operations Research was known as an ability to win a war without really going in to a ‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Battle field
b) Fighting
c) War
d) Both A and B
6. Who defined Operations Research as scientific method of providing executive departments with
a quantitative basis for decisions regarding the operations under their control?
a) Morse and Kimball (1946)
b) P.M.S. Blackett (1948)
c) E.L. Arnoff and M.J. Netzorg
7. Who defined Operations Research as scientific approach to problem solving for executive
management ?
a) E.L. Arnoff
b) P.M.S. Blackett
c) H.M. Wagner
8. Who defined Operations Research as an aid for the executive in marketing his decisions by
providing him with the quantitative information based on the scientific method of analysis ?
a) C. Kitte
b) H.M. Wagner
c) E.L. Arnoff
9. Operations Research has the characteristics the it is done by a team of ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Scientists
b) Mathematicians
c) Academics
d) All of the above
10. There is a great scope for ‐‐‐‐‐‐‐‐‐‐‐‐ working as a team to solve problems of defence by using the
Operations Research approach
a) Economists
b) Administrators
c) Statisticians and Technicians
d) All of the above
11. Operations Research emphasizes on the overall approach to the system. This charecteristics of
Operations Research is often referred as
a) System Orientation
b) System Approach
c) Interdisciplinary Team Approach
12. Operations Research cannot give perfect ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ to problems
a) Answers
b) Solutions
c) Both A and B
d) Decisions
13. Operations Research simply helps in improving the ‐‐‐‐‐‐‐‐‐‐‐‐‐‐ of the solution but does not result
in a perfect solution.
a) Quality
b) Clarity
c) Look
14. Operations Research involves ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ attack of complex problems to arrive at the
optimum solution
a) Scientific
b) Systematic
c) Both A and B
d) Statistical

15. Operations Research uses models built by quantitative measurement of the variables concerning
a given problem and also derives a solution from the model using ‐‐‐‐‐‐‐‐‐‐‐‐‐ of the diversified
solution techniques
a) Two or more
b) One or more
c) Three or more
d) Only One
16. A solution may be extracted from a model either by
a) Conducting experiments on it
b) Mathematical analysis
c) Both A and B
d) Diversified Techniques
17. Operations Research uses models to help the management to determine its ‐‐‐‐‐‐‐‐‐‐‐
scientifically
a) Policies
b) Actions
c) Both A and B
18. Operations Research is a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Science
b) Art
c) Mathematics
d) Both A and B
19. What have been constructed for Operations Research problems and methods for solving the
models that are available in many cases?
a) Scientific Models
b) Algorithms
c) Mathematical Models
20. Which technique is used in finding a solution for optimizing a given objective, such as profit
maximization or cost minimization under certain constraints?
a) Quailing Theory
b) Waiting Line
c) Both A and B
d) Linear Programming
21. What aims at optimizing inventory levels?
a) Inventory Control
b) Inventory Capacity
c) Inventory Planning

22. What can be defined as a useful idle resource which has economic value eg; raw materials, spare
parts, finished items, etc?
a) Inventory Control
b) Inventory
c) Inventory Planning
23. Which theory concerns making sound decisions under conditions of certainity, risk and
uncertainty
a) Game Theory
b) Network Analysis
c) Decision Theory
24. Key concept under which technique are network of events and activities , resource allocation,
time and cost considerations, network paths and critical paths ?
a) Game Theory
b) Network Analysis
c) Decision Theory
25. Which technique is used to imitate an operation prior to actual performance ?
a) Simulation
b) Integrated Production Models
c) Inventory Control
d) Game Theory
26. What is concerned with the prediction of replacement costs and determination of the most
economic replacement policy ?
a) Search Theory
b) Theory of replacement
c) Probabilistic Programming
27. What refers to Linear Programming that includes an evaluation of relative risks and
uncertainties in various alternatives of choice for management decisions ?
a) Probabilistic Programming
b) Stochastic Programming
c) Both A and B
d) Linear Programming
28. What enables us to determine the earliest and the latest times for each of the events and
activities and thereby helps in the identification of the critical path?
a) Programme Evaluation
b) Review Technique (PERT)
c) Both A and B
d) Deployment of resources

29. Linear Programming technique is used to allocate scarce resources in an optimum manner in
problems of ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ ?
a) Schedule
b) Product Mix
c) Both A and B
d) Servicing Cost
30. Operations Research techniques helps the directing authority in optimum allocation of various
limited resources, such as ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Men and Machine
b) Money
c) Material and Time
d) All of the above
31. Operations Research study generally involves how many phases ?
a) Three
b) Four
c) Five
d) Two
32. ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ models involves the allocation of resources to activities in such a manner that some
measure of effectiveness is optimized.
a) Sequencing
b) Allocation Models
c) Queuing Theory
d) Decision Theory
33. Allocation problems can be solved by
a) Linear Programming Technique
b) Non – Linear Programming Technique
c) Both A and B
34. In ‐‐‐‐‐‐‐‐‐‐‐ models, everything is defined and the results are certain,
a) Deterministic Models
b) Probabilistic Models
c) Both A and B
35. In ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ models there is risk and uncertainty
b) Probabilistic Models
c) Both A and B

36. ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ models are obtained by enlarging or reducing the size of the item
a) Iconic Models
b) Analogue Models
c) Symbolic Models
37. Operations Research attempts to find the best and ‐‐‐‐‐‐‐‐‐‐‐‐‐ solution to a problem
a) Optimum
b) Perfect
c) Degenerate
38. The word ‐‐‐‐‐‐‐‐‐‐‐‐‐ may be defined as some action that we apply to some problems or
hypothesis.
a) Research
b) Operation
c) Both A and B
39. The operations Research technique, specially used to determine the optimum strategy is
a) Decision Theory
b) Simulation
c) Game Theory
40. The operations Research technique which helps in minimizing total waiting and service costs is
a) Queuing Theory
b) Decision Theory
c) Both A and B
41. ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ are the representation of reality
a) Models
b) Phases
c) Both A and B
42. ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ are called mathematical models
a) Iconic Models
b) Analogue Models
c) Symbolic Models
43. It is not easy to make any modification or improvement in
a) Iconic Models
b) Analogue Models
c) Symbolic Models

44. In ‐‐‐‐‐‐‐‐‐‐ models one set of properties is used to represent another set of properties
a) Iconic Models
b) Analogue Models
c) Symbolic Models
45. Allocation Models are ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Iconic models
b) Analogue Models
c) Symbolic Models
46. Probabilistic models are also known as
b) Stochastic Models
c) Dynamic Models
d) Static Models
47. ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ models assumes that the values of the variables do not change with time during a
particular period
a) Static Models
b) Dynamic Models
c) Both A and B
48. A ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ models considers time as one of the important variable
a) Static Models
b) Dynamic Models
c) Both A and B
49. Replacement Model is a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ model
a) Static Models
b) Dynamic Models
c) Both A and B
50. ‐‐‐‐‐‐‐‐‐‐‐‐‐‐ may be defined as a method of determining an optimum programme inter
dependent activities in view of available resources
a) Goal Programming
b) Linear Programming
c) Decision Making

51. ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ are expressed is n the form of inequities or equations
a) Constraints
b) Objective Functions
c) Both A and B
52. The objective functions and constraints are linear relationship between ‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Variables
b) Constraints
c) Functions
d) All of the above
53. Assignment problem helps to find a maximum weight identical in nature in a weighted ‐‐‐‐‐‐‐‐‐‐‐‐
a) Tripartite graph
b) Bipartite graph
c) Partite graph
54. All the parameters in the linear programming model are assumed to be ‐‐‐‐‐‐‐‐‐‐‐‐
a) Variables
b) Constraints
c) Functions
55. The solution need not be in ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ numbers
a) Prime Number
b) Whole Number
c) Complex Number
56. Graphic method can be applied to solve a LPP when there are only ‐‐‐‐‐‐‐‐‐‐‐‐‐ variable
a) One
b) More than One
c) Two
d) Three
57. If the feasible region of a LPP is empty, the solution is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Infeasible
b) Unbounded
c) Alternative
58. The variables whose coefficient vectors are unit vectors are called ‐‐‐‐‐‐‐‐‐‐‐‐
a) Unit Variables
b) Basic Variables
c) Non basic Variables

59. Any column or raw of a simplex table is called a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Vector
b) Key column
c) Key Raw
60. If there are ‘m’ original variables and ‘n’ introduced variables, then there will be ‐‐‐‐‐‐‐‐‐‐‐‐‐
columns in the simplex table
a) M + n
b) M – n
c) 3 +m + n
d) M + n – 1
61. A minimization problem can be converted into a maximization problem by changing the sign of
coefficients in the ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Constraints
b) Objective Functions
c) Both A and B
62. If in a LPP , the solution of a variable can be made infinity large without violating the constraints,
the solution is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Infeasible
b) Unbounded
c) Alternative
63. In maximization cases , ‐‐‐‐‐‐‐‐‐‐‐‐‐ are assigned to the artificial variables as their coefficients in
the objective function
a) +m
b) –m
c) 0
64. In simplex method , we add ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ variables in the case of ‘=’
a) Slack Variable
b) Surplus Variable
c) Artificial Variable
65. In simplex method, if there is tie between a decision variable and a slack (or surplus) variable, ‐‐‐
‐‐‐‐‐‐‐‐‐‐‐‐‐‐ should be selected
a) Slack variable
b) Surplus variable
c) Decision variable
66. A BFS of a LPP is said to be ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ if at least one of the basic variable is zero
a) Degenerate
b) Non‐degenerate
c) Infeasible
d) Unbounded
67. In LPP, degeneracy occurs in ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ stages
a) One
b) Two
c) Three
d) Four
68. Every LPP is associated with another LPP is called ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Primal
b) Dual
c) Non‐linear programming
69. As for maximization in assignment problem, the objective is to maximize the ‐‐‐‐‐‐‐‐‐‐‐
a) Profit
b) optimization
c) cost
70. If there are more than one optimum solution for the decision variable the solution is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Infeasible
b) Unbounded
c) Alternative
71. Dual of the dual is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Primal
b) Dual
c) Alternative
72. Operations Research approach is
a) Multi‐disciplinary
b) Scientific
c) Initiative
d) All of the above
73. For analyzing the problem , decision – makers should normally study
a) Its qualitative aspects
b) Its quantitative aspects
c) Both A and B
d) Neither A and B
74. Decision variables are
a) Controllable
b) Uncontrollable
c) Parameters
75. The issue of decision models
a) Is possible when the variable’s value is
b) Reduces the scope of judgment and intuition known with certainty in decision making
c) Requires the knowledge of computer software use
76. ‐‐‐‐‐‐‐‐‐‐‐‐‐ is one of the fundamental combinatorial optimization problems.
a) Assignment problem
b) Transportation problem
c) Optimization Problem
77. An optimization model
a) Mathematically provides the best decision
b) Provides decision within its limited context
c) Helps in evaluating various alternatives constantly
d) All of the above
78. The quantitative approach to decision analysis is a
a) Logical approach
b) Rational approach
c) Scientific approach
d) All of the above
79. Operations Research approach is typically based on the use of
a) Physical model
b) Mathematical model
c) Iconic model
d) Descriptive model
80. In a manufacturing process, who takes the decisions as to what quantities and which process or
processes are to be used so that the cost is minimum and profit is maximum?
a) Supervisor
b) Manufacturer
c) Producer
d) Production manager
81. Linear programming has been successfully applied in ‐‐‐‐‐‐‐‐‐‐‐
a) Agricultural
b) Industrial applications
c) Both A and B
d) Manufacturing

82. The term linearity implies ‐‐‐‐‐‐‐‐‐‐‐ among the relevant variables:
a) Straight line
b) Proportional relationships
c) Linear lines
d) Both A and B
83. Process refers to the combination of ‐‐‐‐‐‐‐‐‐‐‐‐ inputs to produce a particular output.
a) one or more
b) two or more
c) one
84. What has always been very important in the business and industrial world, particularly with
regard to problems concerning productions of commodities?
a) Linear Programming
b) Production
c) Decision – making
85. What are the main questions before a production manager?
a) Which commodity/ commodities to produce
b) In what quantities
c) By which process or processes
d) All of the above
86. Who pointed out that the businessman always studies his production function and his input
prices and substitutes one input for another till his costs become the minimum possible?
a) Alan Marshall
b) Alfred Marsh
c) Alfred Marshall
87. Who invented a method of formal calculations often termed as ?
a) A.V. Kantorovich
b) L.V. Kantorovich
c) T.S. Kantorovich
d) Alfred Marshall
88. Who developed Linear Programming for the purpose of scheduling the complicated
procurement activities of the United States Air Force?
a) George B. Dantzig
b) James B. Dantzig
c) George B. Dante
d) George V. Dantzig

89. This method of formal calculations often termed as Linear Programming was developed later in
which year?
a) 1947
b) 1988
c) 1957
d) 1944
90. What is being considered as one of the most versatile management tools?
a) Electronic Computers
b) Linear Programming
c) Computer Programming
91. LP is a major innovation since ‐‐‐‐‐‐‐‐‐‐‐‐ in the field of business decision – making, particularly
under conditions of certainty.
a) Industrial Revolution
b) World War I
c) World War II
d) French Revolution
92. The world ‘Linear’ means that the relationships are represented by ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Diagonal lines
b) Curved lines
c) Straight lines
d) Slanting lines
93. The world ‘ programming’ means taking decisions ‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Systematically
b) Rapidly
c) Slowly
d) Instantly
94. Who originally called it ‘ Programming of interdependent activities in a linear structure’ but later
shortened it to ‘ Linear Programming’ ?
a) Dantzig
b) Kantorovich
c) Marshall
95. LP can be applied in farm management problems is relates to the allocation of resources such as
‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ , in such a way that is maximizes net revenue
a) Acreage
b) Labour
c) Water supply or working capital
d) All of the above

96. LP model is based on the assumptions of ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Proportionality
b) Additivity
c) Certainty
d) All of the above
97. ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ assumption means the prior knowledge of all the coefficients in the objective
function, the coefficients of the constraints and the resource values.
a) Proportionality
b) Certainty
c) Finite choices
d) Continuity
98. Simple linear programming problem with ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ variables can be easily solved by the
graphical method.
a) One decision
b) Four decisions
c) Three decisions
d) Two decisions
99. Any solution to a LPP which satisfies the non‐ negativity restrictions of the LPP is called its ‐‐‐‐‐‐‐‐
a) Unbounded solution
b) Optimal solution
c) Feasible solution
d) Both A and B
100. Any feasible solution which optimizes (minimizes or maximizes) the objective function of the
LPP is called its ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Optimal solution
b) Non‐basic variables
c) Solution
d) Basic feasible solution
101. A non – degenerate basic feasible solution is the basic feasible solution which has exactly m
positive Xi (i=1,2,…,m), i.e., none of the basic variable is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Infinity
b) One
c) Zero
d) X
102. What is also defined as the non‐negative variables which are added in the LHS of the constraint
to convert the inequality ‘< ‘ into an equation?
a) Slack variables
b) Simplex algorithm
c) Key element

103. Which method is an iterative procedure for solving LPP in a finite number of steps ?
a) Simplex algorithm
b) Slack variable
c) M method
d) Simplex method
104. In simplex algorithm , which method is used to deal with the situation where an infeasible
starting basic solution is given?
a) Slack variable
b) Simplex method
c) M‐ method
105. How many methods are there to solve LPP?
a) Three
b) Two
c) Four
106. ‐‐‐‐‐‐‐‐‐‐‐‐ is another method to solve a given LPP involving some artificial variable ?
a) Big M method
b) Method of penalties
c) Two‐phase simplex method
107. Which variables are fictitious and cannot have any physical meaning ?
a) Optimal variable
b) Decision variable
c) Artificial variable
108. An objective function which states the determinants of the quantity to be either maximized or
minimized is called ‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Feasible function
b) Optimal function
c) Criterion function
109. An assumption that implies that finite numbers of choices are available to a decision – maker
and the decision variables do not assume negative values is known as ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Certainty
b) Continuity
c) Finite choices

110. A set of values X1, X2,…Xn which satisfies the constraints of the LPP is called ‐‐‐‐‐‐‐‐‐‐‐‐
a) Solution
b) Variable
c) Linearity
111. A basic solution which also satisfies the condition in which all basic variables are non ‐negative
is called ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Basic feasible solution
b) Feasible solution
c) Optimal solution
112. All the constraints are expressed as equations and the right hand side of each constraint and all
variables are non‐negative is called ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Canonical variable
b) Canonical form
c) Canonical solution
d) Both A and B
113. An objective function is maximized when it is a ‐‐‐‐‐‐‐‐‐‐‐ function
a) Passive
b) Profit
c) Cost
114. LPP is exactly used in solving what kind of resource allocation problems?
a) Production planning and scheduling
b) Transportation
c) Sales and advertising
d) All of the above
115. Currently, LPP is used in solving a wide range of practical ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Business problems
b) Agricultural problems
c) Manufacturing problems
116. ‐‐‐‐‐‐‐‐‐‐‐‐‐‐ refers to the combination of one or more inputs to produce a particular output.
a) Solution
b) variable
c) Process
117. An optimum solution is considered the ‐‐‐‐‐‐‐‐‐‐‐‐‐‐ among feasible solutions.
a) Worst
b) Best
c) Ineffective
118. Please state which statement is true.
(i) All linear programming problems may not have unique solutions
(ii) The artificial variable technique is not a device that does not get the starting basic feasible
solution.
a) Both (i) and( ii)
b) (ii) only
c) (i) only
d) Both are incorrect
119. Please state which statement is incorrect.
(i) Linear programming was first formulated by an English economist L.V. Kantorovich
(ii) LP is generally used in solving maximization or minimization problems subject to certain
assumptions.
a) (ii) only
b) (i) only
c) Both (i) and( ii)
d) Both are correct
120. ‐‐‐‐‐‐‐‐‐‐‐‐ which is a subclass of a linear programming problem (LPP)
a) Programming problem
b) Transportation problem
c) Computer problem
121. The solution of any transportation problem is obtained in how many stages?
a) Five
b) Four
c) Three
d) Two
122. An optimal solution is the ‐‐‐‐‐‐‐‐‐‐‐ stage of a solution obtained by improving the initial solution
a) Third
b) First
c) Second
d) Final
123. MODI method is used to obtain ‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Optimal solutions
b) Optimality test
c) Both A and B
d) Optimization
124. For solving an assignment problem, which method is used?
a) Hungarian
b) American
c) German
125. To make an unbalanced assignment problem balanced, what are added with all entries as
zeroes?
a) Dummy rows
b) Dummy columns
c) Both A and B
d) Dummy entries
126. Any set of non‐negative allocations (Xij>0) which satisfies the raw and column sum (rim
requirement )is called a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Linear programming
b) Basic feasible solution
c) Feasible solution
127. A feasible solution is called a basic feasible solution if the number of non‐negative allocations is
equal to ‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) m‐n+1
b) m‐n‐1
c) m+n‐1
128. Any feasible solution to a transportation problem containing m origins and n destinations is
said to be ‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Independent
b) Degenerate
c) Non‐degenerate
d) Both A and B
129. A path formed by allowing horizontal and vertical lines and the entire corner cells of which are
occupied is called a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Occupied path
b) Open path
c) Closed path
130. Transportation algorithm can be used for minimizing the transportation cost of ‐‐‐‐‐‐‐‐‐‐‐‐ from
O origins and D destinations
a) Goods
b) Products
c) Items
131. If demand is lesser than supply then dummy demand node is added to make it a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Simple problem
b) Balanced problem
c) Transportation problem
132. Basic cells indicate positive values and non‐ basic cells have ‐‐‐‐‐‐‐‐‐‐‐ value for flow
a) Negative
b) Positive
c) One
d) zero
133. According to transportation problem number of basic cells will be exactly ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) m+n‐0
b) n+m‐1
c) m+n‐1
134. Before starting to solve the problem, it should be balanced. If not then make it balanced by ‐‐‐‐‐
‐‐‐‐‐‐ column incase demand is less than supply or by adding ‐‐‐‐‐‐‐‐‐‐‐‐ raw incase supply is less
than the demand
a) O,D
b) m,n
c) Horizontal, Vertical
d) Unshipped supply, Shortage
135. In which phase is optimization done and how does that phase also checks for optimality
conditions?
a) Phase II
b) Phase I
c) Phase II
136. Optimality conditions are expressed as ‐‐‐‐‐‐‐‐‐‐‐‐‐ incase all non‐basic cells?
a) Negligent costs
b) Advanced costs
c) Reduced costs
137. A ‐‐‐‐‐‐‐‐‐ has rows / column having non‐ basic cells for holding compensating (+ )or (‐) sign.
a) Cycle
b) Dead – end
c) Back track
138. After determining every basic cell with in this cycle, adjustment is obtained as minimum value
in basic cells . this is known as ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Adjustment amount
b) aa
c) Both A and B
d) Alternatives

139. Optimal solution is a feasible solution (not necessarily basic ) which minimizes the ‐‐‐‐‐‐‐‐‐‐
a) Time taken
b) Partial cost
c) Total cost
140. State which of the two statements is correct
(i) the cells in the transportation table can be classified in to occupied cells and unoccupied
cells
(ii) optimal solution is a feasible solution (not necessarily basic ) which maximizes the total cost
a) both (i) and (ii) are correct
b) Two only
c) One only
d) Both (i) and (ii) are incorrect
141. The allocated cells in the transportation table are called ‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Occupied cells
b) Empty cells
c) Both A and B
d) Unoccupied cells
142. VAM stands for ‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Vogeal’s Approximation Method
b) Vogel’s Approximate Method
c) Vangel’s Approximation Method
d) Vogel’s Approximation Method
143. Once the initial basic feasible solution has been computed , what is the next step in the
problem
a) VAM
b) Modified distribution method
c) Optimality test
144. One can find the initial basic feasible solution by using ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ ?
a) VAM
b) MODI
c) Optimality test
145. What do we apply in order to determine the optimum solution ?
a) LPP
b) VAM
c) MODI Method
146. In a TP , if the number of non‐negative independent allocation is ‐‐‐‐‐‐‐‐‐‐‐‐ than m+n‐1.
a) Equivalent
b) Greater
c) Less
147. A given TP is said to be unbalanced, if the total supply is not equal to the total ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Optimization
b) Demand
c) Cost
148. If the total supply is less than the total demand, a dummy source (row) is included in the cost
matrix with ‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Dummy Demand
b) Dummy Supply
c) Zero Cost
d) Both A and B
149. To find the optimal solution, we apply ‐‐‐‐‐‐‐‐‐‐
a) LPP
b) VAM
c) MODI Method
d) Rim
150. For maximization in TP , the objective is to maximize the total ‐‐‐‐‐‐‐‐‐‐
a) Solution
b) Profit Matrix
c) Profit

ANSWERS

1. b 2. d 3. b 4. c 5. d 6. a 7. c 8. a 9. a 10. d 11. d 12. c
13. a 14. c 15. b 16. c 17. c 18. d 19. c 20. d 21. c 22. b 23. c 24.b
25. a 26. b 27. c 28. c 29. c 30. d 31. a 32. b 33. c 34. a 35. b 36. a
37. a 38. b 39. b 40. a 41. a 42. c 43. c 44. a 45. c 46. b 47. a 48. b
49. b 50. b 51. a 52. a 53.b 54. b 55. b 56. c 57. a 58. b 59. a
60. 61. b 62. b 63. a 64. c 65. c 66. a 67. b 68. b 69. a 70. c 71.a
72. c 73. a 74. d 75. d 76. a 77. d 78. c 79. b 80. d 81. c 82. d 83.a
84. c 85. d 86. c 87. d 88. a 89. a 90. b 91. c 92. c 93. a 94. a 95.d
96. d 97. b 98. d 99. c 100. a 101. c 102. a 103. d 104. c 105. b 106. c 107.c
108. c 109. c 110. a 111. a 112. b 113. b 114. d 115. a 116. c 117. b 118. c 119.b
120. b 121. d 122.c 123. c 124. a 125. c 126. c 127. c 128. c 129. c 130. a 131.b
132. d 133. c 134. d 135. c 136. c 137. a 138. c 139. c 140. c 141. c 142. d 143.c
144. a 145. c 146. c 147. b 148. c 149. c 150. c

Operations Research
1. Operations Research approach is ______________.
multi-disciplinary
scientific
intuitive
collect essential data
Correct answer: (A)
multi-disciplinary
2. A feasible solution to a linear programming problem ______________.
must satisfy all the constraints of the problem simultaneously
need not satisfy all of the constraints, only some of them
must be a corner point of the feasible region.
must optimize the value of the objective function
Correct answer: (A)
must satisfy all the constraints of the problem simultaneously
3. If any value in XB column of final simplex table is negative, then the solution is ______________.
infeasible
infeasible
bounded
no solution
Correct answer: (B)
infeasible
4. For any primal problem and its dual______________.
optimal value of objective function is same

dual will have an optimal solution iff primal does too
primal will have an optimal solution iff dual does too
both primal and dual cannot be infeasible
Correct answer: (C)
primal will have an optimal solution iff dual does too
5. The difference between total float and head event slack is ______________
free float
independent float
interference float
linear float
Correct answer: (A)
free float
6. An optimal assignment requires that the maximum number of lines which can be drawn through squares with zero
opportunity cost should be equal to the number of ______________.
rows or columns
rows and columns.
rows+columns- 1
rows-columns.
Correct answer: (A)
rows or columns
7. To proceed with the Modified Distribution method algorithm for solving an transportation problem, the number of
dummy allocations need to be added are______________.
n-1
2n-1
n-2
Correct answer: (B)
n-1
8. Select the correct statement
EOQ is that quantity at which price paid by the buyer is minimum
If annual demand doubles with all other parameters remaining constant, the Economic Order Quantity is doubled
Total ordering cost equals holding cost
Stock out cost is never permitted
Correct answer: (C)
Total ordering cost equals holding cost
9. Service mechanism in a queuing system is characterized by ______________.
customers behavior
servers behavior
customers in the system
server in the system
Correct answer: (B)
servers behavior
10. The objective of network analysis is to______________.
minimize total project duration
minimize toal project cost
minimize production delays, interruption and conflicts
maximize total project duration
Correct answer: (A)
minimize total project duration
11. In program evaluation review technique network each activity time assume a beta distribution
because______________.
it is a unimodal distribution that provides information regarding the uncertainty of time estimates of activities
it has got finite non-negative error
it need not be symmetrical about model value
the project is progressing well
Correct answer: (A)
it is a unimodal distribution that provides information regarding the uncertainty of time estimates of activities
12. If there is no non-negative replacement ratio in solving a Linear Programming Problem then the solution is
______________.
feasible
bounded
unbounded
infinite
Correct answer: (C)
unbounded
13. The calling population is considered to be infinite when ______________.
all customers arrive at once
capacity of the system is infinite
service rate is faster than arrival rate
arrivals are independent of each other
Correct answer: (B)
14. In marking assignments, which of the following should be preferred?
Only row having single zero
Only column having single zero
Only row/column having single zero

Column having more than one zero
Correct answer: (C)
Only row/column having single zero
15. A petrol pump have one pump; Vehicles arrive at the petrol pump according to poison input process at average of 12
per hour. The service time follows exponential distribution with a mean of 4 minutes. The pumps are expected to be idle
for ______________.
3/5
4/5
5/3
6/5
Correct answer: (B)
4/5
16. If the order quantity (size of order) is increased, ______________
holding costs decrease and ordering costs increase
holding costs increase and ordering costs decrease
the total costs increase and then decrease
storage cost as well as stock-out cost increase
Correct answer: (B)
holding costs increase and ordering costs decrease
17. ______________ is a mathematical technique used to solve the problem of allocating limited resource among the
competing activities
Linear Programming problem
Assignment Problem
Replacement Problem
Non linear Programming Problem
Correct answer: (A)

Linear Programming problem
18. A mixed strategy game can be solved by ______________.
Simplex method
Hungarian method
Graphical method
Degeneracy
Correct answer: (C)
Graphical method
19. The activity cost corresponding to the crash time is called the ______________.
critical time
normal time
cost slope
crash cost
Correct answer: (D)
crash cost
20. A set of feasible solution to a Linear Programming Problem is ______________
convex
polygon
triangle
bold
Correct answer: (A)
Convex
21. In an Linear Programming Problem functions to be maximized or minimized are called ______________.
constraints
objective function
basic solution
feasible solution
Correct answer: (B)
objective function
22. If the primal problem has n constraints and m variables then the number of constraints in the dual problem is
______________.
mn
m+n
m-n
m/n
Correct answer: (A)
mn
23. The non basic variables are called ______________.
shadow cost
opportunity cost
slack variable
surplus variable
Correct answer: (A)
shadow cost
24. Key element is also known as ______________.
slack
surplus
artificial
pivot
Correct answer: (D)
pivot
25. The solution to a transportation problem with m-sources and n-destinations is feasible if the numbers of allocations are
______________.
m+n
mn
m-n
m+n-1
Correct answer: (D)
m+n-1
26. The allocation cells in the transportation table will be called ______________ cell
occupied
unoccupied
no
finite
Correct answer: (A)
occupied
27. To resolve degeneracy at the initial solution, a very small quantity is allocated in ______________ cell
occupied
unoccupied
no
finite
Correct answer: (B)
unoccupied
28. The assignment algorithm was developed by ______________ method.

HUNGARIAN
VOGELS
MODI
TRAVELING SALES MAN
Correct answer: (A)
HUNGARIAN
29. An assignment problem is a particular case of ______________.
transportation Problem
assignment Problem
travelling salesman problem
replacement Problem
Correct answer: (A)
transportation Problem
30. The coefficient of slack\surplus variables in the objective function are always assumed to be ______________.
-M
Correct answer: (A)
31. Using ______________ method, we can never have an unbounded solution
Simplex
Dual simplex
Big M
Modi
Correct answer: (B)
Dual simplex
32. The customers of high priority are given service over the low priority customers is ______________.
Pre emptive
FIFO
LIFO
SIRO
Correct answer: (A)
Pre emptive
33. A queuing system is said to be a ______________ when its operating characteristic are independent upon time
pure birth model
pure death model
transient state
steady state
Correct answer: (D)
steady state
34. An activity which does not consume neither any resource nor time is known as ______________.
predecessor activity
successor activity
dummy activity
activity
Correct answer: (C)
dummy activity
35. The difference between total and free float is ______________.

total
free
independent
interference
Correct answer: (D)
interference
36. The number of time estimates involved in Program Evaluation Review Technique problem is ______________.
Correct answer: (C)
37. The assignment problem is always a ______________matrix.
circle
square
rectangle
triangle
Correct answer: (B)
square
38. The slack variables indicate ______________.
excess resource available.
shortage of resource
nil resource
idle resource
Correct answer: (D)
idle resource
39. If the net evaluation corresponding to any non -basic variable is zero, it is an indication of the existence of an
______________.
initial basic feasible solution
optimum basic feasible solution
optimum solution.
alternate optimum solution.
Correct answer: (D)
alternate optimum solution.
40. Mathematical model of linear programming problem is important because ______________.
it helps in converting the verbal description and numerical data into mathematical expression
decision makers prefer to work with formal models
it captures the relevant relationship among decision factors
it enables the use of algebraic technique
Correct answer: (A)
it helps in converting the verbal description and numerical data into mathematical expression
41. While solving a linear programming problem infeasibility may be removed by ______________.
adding another constraint
adding another variable
removing a constraint
removing a variable
Correct answer: (C)
removing a constraint
42. The right hand side constant of a constraint in a primal problem appears in the corresponding dual as______________.
a coefficient in the objective function
a right hand side constant of a function
an input output coefficient a left hand side constraint
coefficient variable
Correct answer: (A)
a coefficient in the objective function
43. During iteration while moving from one solution to the next, degeneracy may occur when______________
the closed path indicates a diagonal move
two or more occupied cells are on the closed path but neither of them represents a corner of the path.
two or more occupied cells on the closed path with minus sign are tied for lowest circled value.
the closed path indicates a rectangle move.
Correct answer: (C)
two or more occupied cells on the closed path with minus sign are tied for lowest circled value.
44. Maximization assignment problem is transformed into a minimization problem by______________.
adding each entry in a column from the maximum value in that column
subtracting each entry in a column from the maximum value in that column
subtracting each entry in the table from the maximum value in that table
adding each entry in the table from the maximum value in that table
Correct answer: (C)
45. Priority queue discipline may be classified as______________.
pre-emptive or non-pre-emptive
limited
unlimited
finite
Correct answer: (C)
unlimited
46. Replace an item when______________.
average cost upto date is equal to the current maintenance cost
average cost upto date is greater than the current maintenance cost
average cost upto date is less than the current maintenance cost.
next year running cost in more than average cost of nth year
Correct answer: (A)
average cost upto date is equal to the current maintenance cost
47. In time cost trade off function analysis______________.
cost decreases linearly as time increases
cost increases linearly as time decreases
cost at normal time is zero
cost increases linearly as time increases
Correct answer: (A)
cost decreases linearly as time increases
48. The transportation problem deals with the transportation of ______________.
a single product from a source to several destinations
a single product from several sources to several destinations
a single product from several sources to a destination
a multi -product from several sources to several destinations
Correct answer: (A)
a single product from a source to several destinations
49. The minimum number of lines covering all zeros in a reduced cost matrix of order n can be ______________.
at the most n
at the least n
n-1
n+1
Correct answer: (A)
at the most n
50. For a 2.5% increase in order quantity (under fundamental EOQ problem) the total relevant cost would ______________
increase by 2.5%.
decrease by 2.5%.
increase by 0.25%.
decrease by 0.25%.
Correct answer: (A)
increase by 2.5%.
51. In the basic EOQ model, if the lead time increases from 2 to 4 days, the EOQ will ______________
double increase
remain constant
but not double
decrease by a factor of two
Correct answer: (B)
remain constant
52. When the sum of gains of one player is equal to the sum of losses to another player in a game, this situation is known
as ______________.
two-person game
two-person zero-sum game
zero-sum game
non-zero-sum game
Correct answer: (C)
zero-sum game
53. In the network, one activity may connect any ______________ nodes
Correct answer: (B)
54. Graphical method is also known as ______________.
Simplex Method
Dual Simplex Method
Big-M Method
Search-Approach Method
Correct answer: (D)
Search-Approach Method
55. If the given Linear Programming Problem is in its standard form then primal-dual pair is ______________.
symmetric
un symmetric
square
triangle
Correct answer: (B)
un symmetric
56. The method used to solve Linear Programming Problem without use of the artificial variable is called ______________.
Simplex Method
Big-M Method
Dual Simplex Method
Graphical Mehtod
Correct answer: (C)
Dual Simplex Method
57. When the total demand is equal to supply then the transportation problem is said to be ______________
balanced
unbalanced
maximization
minimization
Correct answer: (A)
balanced
58. For finding an optimum solution in transportation problem ______________ method is used.
Simplex
Big-M
Modi
Hungarian
Correct answer: (C)
Modi
59. Linear Programming Problem is a technique of finding the ______________.
optimal value
approximate value
initial value
infeasible value
Correct answer: (A)
optimal value
60. Any solution to a Linear Programming Problem which also satisfies the non- negative notifications of the problem has
______________.
solution
basic solution
basic feasible solution
feasible solution
Correct answer: (D)
feasible solution
61. Customers arrive at a box office window, being manned ny single individual, according to Poisson input process with
mean rate of 20 per hour, while the mean service time is 2 minutes. Which of the following is not true for this system?
E(n) = 2 customers
E(m) = 4/3 customers
E(v) = 6 minutes
E(w) = 16 minutes
Correct answer: (A)
E(n) = 2 customers
62. A game is said to be strictly determinable if______________.
maximin value equal to minimax value
maximin value is less than or equal to minimax value
maximin value is greater than or equal to minimax value
maximin value is not equal to minimax value
Correct answer: (A)
maximin value equal to minimax value

63. The irreducible minimum duration of the project is called ______________.
critical time
normal time
cost slope
crash duration
Correct answer: (D)
crash duration
64. The cost of a slack variable is ______________.
-1
Correct answer: (A)
65. Linear Programming Problem that can be solved by graphical method has ______________.
linear constraints
quadratic constraints
non linear constraints
bi-quadratic constraints
Correct answer: (A)
linear constraints
66. If one or more variable vanish then a basic solution to the system is called ______________.
non feasible region
feasible region
degenerate solution
basic solution
Correct answer: (C)
degenerate solution
67. ______________ method is an alternative method of solving a Linear Programming Problem involving artificial
variables
Simplex Method
Big-M Method
Dual Simplex Method
Graphical Mehtod
Correct answer: (B)
Big-M Method
68. The server utilization factor is also known as ______________
erlang distribution
poisson distribution
exponential distribution
traffic intensity
Correct answer: (D)
traffic intensity
69. In a transportation table, an ordered set of______________ or more cells is said to form a loop
Correct answer: (C)

4
70. A Linear Programming Problem have ______________ optimal solution
more than 1
more than 2
Correct answer: (C)
more than 1
71. An n-tuple of real numbers which satisfies the constraints of Linear Programming Problem is called ______________
solution
basic solution
feasible solution
Correct answer: (A)
solution
72. Chose the correct statement: A degenerate solution is one that______________.
gives an optimum solution to the Linear Programming Problem
gives zero value to one or more of the basic variables
yields more than one way to achieve the objective
makes use of all available resources
Correct answer: (B)
73. At any iteration of the usual simplex method, if there is at least one basic variable in the basis at zero level and all the
index numbers are non-negative, the current solution is ______________.
basic solution
non basic solution
degenerate
non degenerate
Correct answer: (C)
degenerate
74. The model in which only arrivals are counted and no departure takes place are called ______________.
pure birth model
pure death model
birth death model
death birth model
Correct answer: (A)
pure birth model
75. ______________ of a queuing system is the state where the probability of the number of customers in the system
depends upon time
pure birth model
pure death model
transient state
steady state
Correct answer: (D)
steady state
76. The initial event which has all outgoing arrows with no incoming arrow is numbered ______________.
-1
2
Correct answer: (A)
77. In a network diagram an event is denoted by the symbol ______________.
arrow
straight line
curve
circle
Correct answer: (D)
circle
78. An ______________ represent the start or completion of some activity and as such it consumes no time
activity
event
slack
path
Correct answer: (B)
event
79. ______________ is used for non-repetitive jobs
Queue
Replacement
CPM
PERT
Correct answer: (C)
CPM
80. The assignment problem will have alternate solutions when the total opportunity cost matrix has ______________
atleast one zero in each row and column
when all rows have two zeros
when there is a tie between zero opportunity cost cells
if two diagonal elements are zeros.
Correct answer: (C)
when there is a tie between zero opportunity cost cells
81. The region common to all the constraints including the non-negativity restrictions is called the ______________.
solution space
unique solution
optimum solution
infeasible solution
Correct answer: (A)
solution space
82. A activity in a network diagram is said to be ______________ if the delay in its start will further delay the project
completion time.
forward pass
backward pass
critical.
non-critical.
Correct answer: (C)
critical
83. Operation research approach is typically based on the use of ______________.
physical model.
mathematical model.
iconic model.
descriptive model.
Correct answer: (B)
mathematical model.
84. An Iso-profit line represents ______________.
a boundary of the feasible region
an infinite number of solution all of which yield the same cost
an infinite number of solutions all of which yield the same profit
an infinite number of optimal solutions
Correct answer: (C)
an infinite number of solutions all of which yield the same profit
85. If an artificial variable is present in the basic variable column of optimal simplex table, then the problem has
______________ solution.
alternative
no solution
bounded
infeasible
Correct answer: (D)
infeasible
86. The dummy source or destination in a transportation problem is added to ______________.
satisfy rim conditions
prevent solution from becoming degenerate
ensure that total cost does not exceed a limit
the solution not be degenerate
Correct answer: (A)
satisfy rim conditions

87. Which of the following methods is used to verify the optimality of the current solution of the transportation
problem______________.
Least cost method
Vogel's Approximation method
Row minima method
Modified Distribution method
Correct answer: (D)
Modified Distribution method
88. For a salesman who has to visit n cities, following are the ways of his tour plan ______________.
n!
(n+a)!
(n-a)!
Correct answer: (C)
(n-a)!
89. Economic order quantity results in ______________
equalisation of carrying cost and procurement cost
favourable procurement price
reduced chances of stock outs
minimization of set up cost
Correct answer: (A)
equalisation of carrying cost and procurement cost
90. The problem of replacement is felt when job performing units fail ______________.
suddenly and gradually

gradually
suddenly
neither gradually nor suddenly
Correct answer: (A)
suddenly and gradually
91. Float analysis is useful for ______________.
total float
free float
independent float
variance of each float
Correct answer: (B)
free float
92. The difference between free float and tail event slack is ______________
total float
independent float
interference float
slack
Correct answer: (B)
independent float
93. The assignment problem is a special case of transportation problem in which ______________.
number of origins are less than the number of destinations
number of origins are greater than the number of destinations
number of origins are greater than or equal to the number of destinations
number of origins equals the number of destinations
Correct answer: (D)

number of origins equals the number of destinations
94. The average arrival rate in a single server queuing system is 10 customers per hour and average service rate is 15
customers per hour. The average time that a customer must wait before it is taken up for service shall be
______________minutes.
10
12
Correct answer: (B)
95. The time between the placement of an order and its delivery is called as ______________
buffer time
lead time
Economic Order Quantity
capital time
Correct answer: (B)
lead time
96. In Program Evaluation Review Technique the maximum time that is required to perform the activity under extremely
bad conditions is known as ______________.
normal time
optimistic time
most likely time
pessimistic time
Correct answer: (D)
pessimistic time
97. All of the following may be used to find the EOQ except ______________.
optimal number of days supply to order
number of orders which minimize ordering costs optimal
number of rupees per order optimal
number of orders per year
Correct answer: (D)
number of orders per year
98. A feasible solution of an Linear Programming Problem that optimizes the objective function is called ______________
optimum solution
feasible solution
solution
Correct answer: (B)
optimum solution
99. Charnes method of penalty is called ______________
Simplex Method
Dual Simplex Method
Big-M Method
Graphical Method
Correct answer: (C)
Big-M Method
100. If the given Linear Programming Problem is in its canonical form then primal-dual pair is ______________.
symmetric
un symmetric
square
non square
Correct answer: (B)
un symmetric
101. All the basis for a transportation problem is ______________.
square
rectangle
diagonal
triangle
Correct answer: (D)
triangle
102. In the transportation table, empty cells will be called ______________.
occupied
unoccupied
no
finite
Correct answer: (B)
unoccupied
103. ______________ is a completely degenerate form of a transportation problem
Transportation Problem
Assignment Problem
Travelling salesman problem
Replacement Problem
Correct answer: (B)
Assignment Problem
104. The linear function to be maximized or minimized is called ______________ function.

injective
surjective
bijective
optimal
Correct answer: (D)
optimal
105. The coefficient of an artificial variable in the objective function of penalty method are always assumed to be
______________.
-M
Correct answer: (D)
-M
106. The process that performs the services to the customer is known as ______________.
queue
service channel
customers
server
Correct answer: (B)
service channel
107. A queuing system is said to be a ______________ when its operating characteristic are dependent upon time
pure birth model
pure death model
transient state
steady state
Correct answer: (C)
transient state
108. Slack is also known as ______________.
float
event
activity
path
Correct answer: (A)
float
109. What type of distribution does a time follow in program evaluation review technique model?
Poisson
Exponential
Normal
Chi Square
Correct answer: (C)
Normal
110. A activity in a network diagram is said to be ______________ if the delay in its start will further delay the project
completion time.
critical
critical path
crash
non critical
Correct answer: (A)
Critical
111. The total opportunity cost matrix is obtained by doing ______________.
row operation on row opportunity cost matrix
column operation on row opportunity cost matrix
column operation on column opportunity cost matrix
none of the above.
Correct answer: (B)
column operation on row opportunity cost matrix
112. The simplex method is also called the ______________.
dual simplex method.
Modi method
simplex technique
Big-M method
Correct answer: (C)
simplex technique
113. A degenerate solution is one that ______________.
gives an optimum solution to the Linear Programming Problem
yields more than one way to achieve the objective
makes use of all the available resources
Correct answer: (B)
114. Graphical method of linear programming is useful when the number of decision variable are ______________.
2
3
Correct answer: (B)
115. In the optimal simplex table, Zj-Cj=0 value indicates ______________.
alternative solution
bounded solution
infeasible solution
unbounded solution
Correct answer: (A)
116. If primal linear programming problem has a finite solution, then dual linear programming problem should
______________.
have optimal solution
satisfy the Rim condition
have degenerate solution
have non-degenerate solution
Correct answer: (B)
satisfy the Rim condition
117. While solving an assignment problem, an activity is assigned to a resource through a square with zero opportunity
cost because the objective is to______________.
minimize total cost of assignment.
reduce the cost of assignment to zero
reduce the cost of that particular assignment to zero
reduce total cost of assignment
Correct answer: (A)

minimize total cost of assignment.
118. If the procurement cost used in the formula to compute EOQ is half of the actual procurement cost, the EOQ so
obtained will be ______________
half of EOQ
one third of EOQ
one fourth of EOQ
0.707 time EOQ
Correct answer: (D)
0.707 time EOQ
119. The calling population is assumed to be infinite when ______________.
service rate is faster than arrival rate
all customers arrive at once
Correct answer: (B)
120. If an activity has zero slack, it implies that______________.
the project is progressing well
it is a dummy activity
it lies on the critical path
it lies a non critical path
Correct answer: (C)
it lies on the critical path
121. The transportation problem is balanced, if ______________.

total demand and total supply are equal and the number of sources equals the number of destinations.
none of the routes is prohibited
total demand equals total supply irrespective of the number of sources and destinations
number of sources matches with number of destinations
Correct answer: (C)
total demand equals total supply irrespective of the number of sources and destinations
122. In an assignment problem involving 5 workers and 5 jobs, total number of assignments possible are ______________.
10
15
20
Correct answer: (A)
123. All of the following are assumptions of the EOQ model except ______________
the usage rate is reasonably constant
replenishment is not instantaneous
only one product is involved
there are no quantity discount price
Correct answer: (B)
replenishment is not instantaneous
124. Average number of trains spent in the yard is denoted by ______________.
E(n)
E(m)
E(v)
E(w)
Correct answer: (C)
E(v)
125. Graphical method of linear programming is useful when the number of decision variable are ______________
Correct answer: (A)
126. The cost of a surplus variable is ______________.
-1
Correct answer: (A)
127. The dual of the dual is ______________.
dual-primal
primal-dual
dual
primal
Correct answer: (D)
primal
128. Solution of a Linear Programming Problem when permitted to be infinitely large is called ______________.
unbounded
bounded
optimum solution
no solution
Correct answer: (C)
optimum solution
129. When the total demand is not equal to supply then it is said to be ______________.
balanced
unbalanced
maximization
minimization
Correct answer: (B)
unbalanced
130. All equality constraints can be replaced equivalently by ______________ inequalities
Correct answer: (B)
131. If the primal has an unbound objective function value then the dual has ______________.
solution
basic solution
no feasible solution
Correct answer: (D)
no feasible solution
132. If there is no non-negative replacement ratio in a solution which is sought to be improved, then the solution is
______________.
bounded
unbounded
no solution
Correct answer: (B)
unbounded
133. An activity is represented by a/an ______________.
arrow
straight line
curve
arc
Correct answer: (A)
arrow
134. A project consists of a number of tasks which are called ______________.
activities
floats
events
paths
Correct answer: (A)
activities
135. The similarity between assignment problem and transportation problem is ______________.
both are rectangular matrices
both are square matrices
both can be solved y graphical method
both have objective function and non-negativity constraints
Correct answer: (D)
both have objective function and non-negativity constraints
136. The penalty for not taking correct decision is known as ______________.
fine
loss
cost
opportunity cost
Correct answer: (D)
opportunity cost
137. In a given system of m simultaneous linear equations in n unknowns (m<n) there will be ______________.
n basic variables
m basic variables
(n-m) basic variables
(n+m) basic variables
Correct answer: (B)
m basic variables
138. If all aij values in the entering variable column of the simplex table are negative, then ______________.
solution is unbounded
solution is degenerate
there exist no solution
there are multiple solutions

Correct answer: (A)
solution is unbounded
139. An unoccupied cell in the transportation method is analogous to a______________.
Zj-Cj value in the simplex table.
variable in the B-column in the simplex table.
variable not in the B-column in the simplex table.
value in the XB column in the simplex table.
Correct answer: (B)
variable in the B-column in the simplex table.
140. Every basic feasible solution of a general assignment problem having a square pay-off matrix of order n should have
assignments equal to______________.
2n-1
n+1
n-2
Correct answer: (A)
2n-1
141. Which of the following is correct?
Re-order quantity in a fixed order-interval system equals EOQ
Review period of the item is always kept higher than its lead time
Re-order level of an item is always more than its minimum stock
Buffer stock is the total stock kept to meet the demand during lead time
Correct answer: (C)
Re-order level of an item is always more than its minimum stock

142. The group replacement policy is suitable for identical low cost items which are likely to ______________.
fail suddenly
fail completely and suddenly
fail over a period of time
be progressive and retrogressive
Correct answer: (C)
fail over a period of time
143. Identify the correct statement
an assignment problem may require the introduction of both dummy row and dummy column
an assignment problem with m rows and n columns will involves a total of m x n possible assignments
an unbalanced assignment is one where the number of rows is more than, or less than the number of columns
balancing any unbalanced assignment problem involves adding one dummy row or column
Correct answer: (C)
an unbalanced assignment is one where the number of rows is more than, or less than the number of columns
144. A game is said to be fair if ______________.
lower and upper values are zero
only lower value to be zero
only upper value to be zero
lower and upper values are not equal to zero
Correct answer: (A)
lower and upper values are zero
145. Which of the following is not a part of holding (or carrying) costs?
Rent for storage space
Extra expenses for an overnight express mail.
Spoilage costs
Electricity and heat for the buildings
Correct answer: (B)
Extra expenses for an overnight express mail.
146. The area bounded by all the given constraints is called ______________.
feasible region
basic solution
non feasible region
optimum basic feasible solution
Correct answer: (A)
feasible region
147. When D=18000, holding cost=Rs.1.20, set-up cost=Rs.400 ,EOQ = ______________
3465
3750
3500
4000
Correct answer: (A)
3465
148. Given arrival rate = 15/hr, service rate = 20/hr, the value of traffic intensity is ______________.
3/4
4/3
3/5
4/5
Correct answer: (A)
3/4
149. An activity is critical if its ______________ float is zero
total
free
independent
interference
Correct answer: (A)
total
150. ______________ is employed in construction and business problems
Queue
Replacement
CPM
PERT
Correct answer: (D)
PERT
151. __________ occurs when the number of occupied squares is less than the number of rows plus
Degeneracy
Infeasibility
Unboundedness
Unbalance
Redundancy
Correct answer: (A)
Degeneracy
152. __________ or __________ are used to "balance" an assignment or transportation problem.
Destinations; sources
Units supplied; units demanded

Dummy rows; dummy columns
Large cost coefficients; small cost coefficients
Artificial cells; degenerate cells
Correct answer: (C)
Dummy rows; dummy columns
153. A solution can be extracted from a model either by
Conducting experiments on it
Mathematical analysis
Both A and B
Diversified Techniques
Correct answer: (C)
Both A and B
154. An alternative optimal solution to a minimization transportation problem exists whenever opportunity cost
corresponding to unused route of transportation is:
Positive & greater than zero
Positive with at least one equal to zero
Negative with at least one equal to zero
None of the above
Correct answer: (B)
Positive with at least one equal to zero
155. Which of these statements about the stepping-stone method is best?
A dummy source and destination must be added if the number of rows plus columns minus 1 is not equal to the number
of filled squares.
Only squares containing assigned shipments can be used to trace a path back to an empty square.
An improvement index that is a net positive means that the initial solution can be improved.
Only empty squares can be used to trace a path back to a square containing an assigned shipment
Correct answer: (B)
156. An assignment problem can be viewed as a special case of transportation problem in which the capacity from each
source is __________ and the demand at each destination is __________.
1; 1
Infinity; infinity
0; 0
1000; 1000
-1; -1
Correct answer: (A)
1; 1
157. Both transportation and assignment problems are members of a category of LP problems called __________.
shipping problems
logistics problems
generalized flow problems
routing problems
network flow problems
Correct answer: (E)
network flow problems
158. Consider the given vectors: a(2,0), b(0,2), c(1,1), and d(0,3). Which of the following vectors are linearly independent?
a, b, and c are independent
a, b, and d are independent
a and c are independent
b and d are independent
Correct answer: (C)
a and c are independent

159. Consider the linear equation
2 x1 + 3 x2 - 4 x3 + 5 x4 = 10
How many basic and non-basic variables are defined by this equation?
One variable is basic, three variables are non-basic
Two variables are basic, two variables are non-basic
Three variables are basic, one variable is non-basic
All four variables are basic
Correct answer: (A)
One variable is basic, three variables are non-basic
160. During an iteration while moving from one solution to the next, degeneracy may occur when
The closed path indicates a diagonal move
Two or more occupied cells are on the closed path but neither of them represents a corner of the path.
Two or more occupied cells on the closed path with minus sign are tied for lowest circled value
Either of the above
Correct answer: (C)
Two or more occupied cells on the closed path with minus sign are tied for lowest circled value
161. Feasible solution satisfies __________
Only constraints
only non-negative restriction
[a] and [b] both
[a],[b] and Optimum solution
Correct answer: (C)
[a] and [b] both
162. Graphical optimal value for Z can be obtained from

Corner points of feasible region
Both a and c
corner points of the solution region
none of the above
Correct answer: (A)
Corner points of feasible region
163. Hungarian Method is used to solve
A transportation problem
A travelling salesman problem
A LP problem
Both a & b
Correct answer: (B)
A travelling salesman problem
164. Identify the type of the feasible region given by the set of inequalities
x - y <= 1
x - y >= 2
where both x and y are positive.
A triangle
A rectangle
An unbounded region
An empty region
Correct answer: (D)
An empty region
Equal to zero
Most negative number

Most positive number
Any value
Correct answer: (B)
Most negative number
166. In a transportation problem, we must make the number of __________ and __________ equal.
destinations; sources
units supplied; units demanded
columns; rows
positive cost coefficients; negative cost coefficients
warehouses; suppliers
Correct answer: (B)
units supplied; units demanded
167. In a transportation problem, when the number of occupied routes is less than the number of rows plus the number of
columns -1, we say that the solution is:
Unbalanced.
Infeasible.
Optimal.
impossible.
Degenerate.
Correct answer: (E)
Degenerate
168. In assignment problem of maximization, the objective is to maximise
Profit
optimization
cost
None of the above

Correct answer: (A)
Profit
169. In case of an unbalanced problem, shipping cost coefficients of __________ are assigned to each created dummy
factory or warehouse.
very high positive costs
very high negative costs
10
zero
one
Correct answer: (D)
zero
170. In Degenerate solution value of objective function __________.
increases infinitely
basic variables are nonzero
decreases infinitely
One or more basic variables are zero
Correct answer: (D)
One or more basic variables are zero
171. In game theory, the outcome or consequence of a strategy is referred to as the
payoff.
penalty.
reward.
end-game strategy.
Correct answer: (A)
payoff.
172. In graphical method the restriction on number of constraint is __________.
not more than 3
none of the above
Correct answer: (D)
none of the above
173. In graphical representation the bounded region is known as __________ region.
Solution
basic solution
feasible solution
optimal
Correct answer: (C)
feasible solution
174. In LPP the condition to be satisfied is
Constraints have to be linear
Objective function has to be linear
none of the above
both a and b
Correct answer: (D)
both a and b
175. In operations research, the __________ are prepared for situations.
mathematical models
physical models diagrammatic

diagrammatic models
all of above
Correct answer: (A)
mathematical models
177. One disadvantage of using North-West Corner rule to find initial solution to the transportation problem is that
It is complicated to use
It does not take into account cost of transportation
It leads to a degenerate initial solution
All of the above
Correct answer: (B)
It does not take into account cost of transportation
178. Operations management can be defined as the application of __________ to a problem within a system to yield the
optimal solution.
Suitable manpower
mathematical techniques, models, and tools
Financial operations
all of above
Correct answer: (B)
mathematical techniques, models, and tools
179. Operations research is based upon collected information, knowledge and advanced study of various factors impacting
a particular operation. This leads to more informed __________.
Management processes
Decision making
Procedures
all of above
Correct answer: (B)

Decision making
180. Operations research is the application of __________ methods to arrive at the optimal Solutions to the problems.
economical
scientific
a and b both
artistic
Correct answer: (B)
Scientific
181. Operations research was known as an ability to win a war without really going in to __________
Battle field
Fighting
The opponent
Both A and B
Correct answer: (D)
Both A and B
182. Optimal solution of an assignment problem can be obtained only if
Each row & column has only one zero element
Each row & column has at least one zero element
The data is arrangement in a square matrix
None of the above
Correct answer: (A)
Each row & column has only one zero element
183. OR can evaluate only the effects of __________.
Personnel factors.
Financial factors
Numeric and quantifiable factors.
all of above
Correct answer: (C)
Numeric and quantifiable factors.
184. OR has a characteristics that it is done by a team of
Scientists
Mathematicians
Academics
All of the above
Correct answer: (D)
All of the above
185. OR techniques help the directing authority in optimum allocation of various limited resources like __________
Men and Machine
Money
Material and Time
All of the above
Correct answer: (D)
All of the above
186. OR uses models to help the management to determine its __________
Policies
Actions
Both A and B
None of the above
Correct answer: (C)

Both A and B
Dummy allocation(s) needs to be added
The problem has no feasible solution
The multiple optimal solution exist
a & b but not c
Correct answer: (C)
The multiple optimal solution exist
Satisfy rim conditions
Prevent solution from becoming degenerate
Ensure that total cost does not exceed a limit
None of the above
Correct answer: (A)
Satisfy rim conditions
189. The equation Ri + Kj = Cij is used to calculate __________.
an improvement index for the stepping-stone method
the opportunity costs for using a particular route
the MODI cost values (Ri, Kj)
the degeneracy index
optimality test
Correct answer: (C)
the MODI cost values (Ri, Kj)
190. The initial solution of a transportation problem can be obtained by applying any known method. However, the only
condition is that
The solution be optimal
The rim conditions are satisfied
The solution not be degenerate
All of the above
Correct answer: (B)
The rim conditions are satisfied
191. The large negative opportunity cost value in an unused cell in a transportation table is chosen to improve the current
solution because
It represents per unit cost reduction
It represents per unit cost improvement
It ensure no rim requirement violation
None of the above
Correct answer: (A)
It represents per unit cost reduction
192. The method of finding an initial solution based upon opportunity costs is called __________.
the northwest corner rule
Vogel's approximation
Johanson's theorem
Flood's technique
Hungarian method
Correct answer: (B)
Vogel's approximation
193. The net cost of shipping one unit on a route not used in the current transportation problem solution is called the
__________.
change index
new index
MODI index
idle index
Improvement index
Correct answer: (E)
Improvement index
194. The objective function and constraints are functions of two types of variables, __________ variables and __________
variables.
Positive and negative
Controllable and uncontrollable
Strong and weak
None of the above
Correct answer: (B)
Controllable and uncontrollable
195. The objective function for a minimization problem is given by
z = 2 x1 - 5 x2 + 3 x3
The hyperplane for the objective function cuts a bounded feasible region in the space
(x1,x2,x3). Find the direction vector d, where a finite optimal solution can be reached.
d(2,-5,3)
d(-2,5,-3)
d(2,5,3)
d(-2,-5,-3)
Correct answer: (B)
d(-2,5,-3)
Total supply equals total demand
The solution so obtained is not feasible

The few allocations become negative
None of the above
Correct answer: (B)
The solution so obtained is not feasible
197. The only restriction we place on the initial solution of a transportation problem is that: we must have nonzero
quantities in a majority of the boxes.
all constraints must be satisfied.
demand must equal supply.
we must have a number (equal to the number of rows plus the number of columns minus one) of boxes which contain
nonzero quantities.
None of the above
Correct answer: (A)
all constraints must be satisfied.
198. The Operations research technique which helps in minimizing total waiting and service costs is
Queuing Theory
Decision Theory
Both A and B
None of the above
Correct answer: (A)
Queuing Theory
199. The procedure used to solve assignment problems wherein one reduces the original assignment costs to a table of
opportunity costs is called __________.
stepping-stone method
matrix reduction
MODI method
northwest reduction
simplex reduction
Correct answer: (B)
matrix reduction
200. The purpose of a dummy source or dummy destination in a transportation problem is to
prevent the solution from becoming degenerate.
obtain a balance between total supply and total demand.
make certain that the total cost does not exceed some specified figure.
provide a means of representing a dummy problem.
Correct answer: (B)
obtain a balance between total supply and total demand
201. The purpose of the stepping-stone method is to
develop the initial solution to the transportation problem.
assist one in moving from an initial feasible solution to the optimal solution.
determine whether a given solution is feasible or not.
identify the relevant costs in a transportation problem.
Correct answer: (B)
assist one in moving from an initial feasible solution to the optimal solution.
202. The smallest quantity is chosen at the corners of the closed path with negative sign to be assigned at unused cell
because
It improve the total cost
It does not disturb rim conditions
It ensure feasible solution
All of the above
Correct answer: (C)
It ensure feasible solution

203. The solution to a transportation problem with â€˜mâ€™ rows (supplies) & â€˜nâ€™ columns (destination) is feasible if
number of positive allocations are
m+n
m*n
m+n-1
m+n+1
Correct answer: (C)
m+n-1
204. The transportation method assumes that
there are no economies of scale if large quantities are shipped from one source to one destination.
the number of occupied squares in any solution must be equal to the number of rows in the table plus the number of
columns in the table plus 1.
there is only one optimal solution for each problem.
the number of dummy sources equals the number of dummy destinations.
Correct answer: (A)
there are no economies of scale if large quantities are shipped from one source to one destination.
205. What enables us to determine the earliest and latest times for each of the events and activities and thereby helps in
the identification of the critical path?
Programme Evaluation
Review Technique (PERT)
Both A and B
Deployment of resources
Correct answer: (C)
Both A and B
206. What have been constructed from OR problems an methods for solving the models that are available in many cases?
Scientific Models
Algorithms
Mathematical Models
None of the above
Correct answer: (C)
Mathematical Models
207. What is the difference between minimal cost network flows and transportation problems?
The minimal cost network flows are special cases of transportation problems
The transportation problems are special cases of the minimal cost network flows
There is no difference
The transportation problems are formulated in terms of tableaus, while the minimal cost network flows are formulated
in terms of graphs
Correct answer: (B)
The transportation problems are special cases of the minimal cost network flows
208. What is the objective function in linear programming problems?
A constraint for available resource
An objective for research and development of a company
A linear function in an optimization problem
A set of non-negativity conditions
Correct answer: (C)
A linear function in an optimization problem
209. When total supply is equal to total demand in a transportation problem, the problem is said to be
Balanced
Unbalanced
Degenerate
None of the above

Correct answer: (A)
Balanced
210. Which of the following is a method for improving an initial solution in a transportation problem?
northwest-corner
intuitive lowest-cost
southeast-corner rule
stepping-stone
Correct answer: (D)
stepping-stone
211. Which of the following is NOT needed to use the transportation model?
the cost of shipping one unit from each origin to each destination
the destination points and the demand per period at each
the origin points and the capacity or supply per period at each
degeneracy
Correct answer: (D)
degeneracy
212. Which of the following is not the phase of OR methodology?
Formulating a problem
Constructing a model
Establishing controls
Controlling the environment
Correct answer: (D)
Controlling the environment
213. Which of the following is used to come up with a solution to the assignment problem?
MODI method
northwest corner method
stepping-stone method
Hungarian method
none of the above
Correct answer: (D)
Hungarian method
214. Which of the following methods is used to verify the optimality of the current solution of the transportation problem
Least cost method
Vogel's approximation method
Modified distribution method
All of the above
Correct answer: (C)
Modified distribution method
A dummy source and destination must be added if the number of rows plus columns minus 1 is not equal to the number
of filled squares.
An improvement index that is a net positive means that the initial solution can be improved.
Only empty squares can be used to trace a path back to a square containing an assigned shipment
Correct answer: (B)
216. Which statement characterizes standard form of a linear programming problem?
Constraints are given by inequalities of any type
Constraints are given by a set of linear equations
Constraints are given only by inequalities of >= type

Constraints are given only by inequalities of <= type
Correct answer: (A)
Constraints are given by inequalities of any type
217. Which technique is used in finding a solution for optimizing a given objective, such as profit maximization or cost
reduction under certain constraints?
Quailing Theory
Waiting Line
Both A and B
Linear Programming
Correct answer: (D)
Linear Programming
218. Who defined OR as scientific method of providing execuitive departments with a quantitative basis for decisions
regarding the operations under their control?
Morse and Kimball (1946)
P.M.S. Blackett (1948)
E.L. Arnoff and M.J. Netzorg
None of the above
Correct answer: (A)
Morse and Kimball (1946)
219. With the transportation technique, the initial solution can be generated in any fashion one chooses. The only
restriction is that
the edge constraints for supply and demand are satisfied.
the solution is not degenerate.
the solution must be optimal.
one must use the northwest-corner method.
Correct answer: (A)

the edge constraints for supply and demand are satisfied
OPERATIONS RESEARCH
Multiple Choice Questions
1. Operations research is the application of methods to arrive at the optimal

Solutions to the problems.
A. economical
B. scientific
C. a and b both
D. artistic
2. In operations research, the ------------------------------ are prepared for situations.

A. mathematical models
B. physical models diagrammatic
C. diagrammatic models
3. Operations management can be defined as the application of -----------------------------------

-------to a problem within a system to yield the optimal solution.
A. Suitable manpower
B. mathematical techniques, models, and tools
C. Financial operations
4. Operations research is based upon collected information, knowledge and advanced study
of various factors impacting a particular operation. This leads to more informed -----------
--------------------------.
A. Management processes
B. Decision making
C. Procedures
5. OR can evaluate only the effects of ------------------------------------------------ --.

A. Personnel factors.
B. Financial factors
C. Numeric and quantifiable factors.
True-False
6. By constructing models, the problems in libraries increase and cannot be solved.
A. True
B. False
7. Operations Research started just before World War II in Britain with the establishment of
teams of scientists to study the strategic and tactical problems involved in military
operations.
A. True
B. False
8. OR can be applied only to those aspects of libraries where mathematical models can be
prepared.
A. True
B. False
9. The main limitation of operations research is that it often ignores the human element in
the production process.
A. True
B. False
10. Which of the following is not the phase of OR methodology?

A. Formulating a problem
B. Constructing a model
C. Establishing controls
D. Controlling the environment
11. The objective function and constraints are functions of two types of variables,
variables and variables.
A. Positive and negative
B. Controllable and uncontrollable
C. Strong and weak
D. None of the above
12. Operations research was known as an ability to win a war without really going in to
A. Battle field
B. Fighting
C. The opponent
D. Both A and B
13. Who defined OR as scientific method of providing execuitive departments with a

quantitative basis for decisions regarding the operations under their control?
A. Morse and Kimball (1946)
B. P.M.S. Blackett (1948)
C. E.L. Arnoff and M.J. Netzorg
14. OR has a characteristics that it is done by a team of

A. Scientists
B. Mathematicians
C. Academics
D. All of the above
15. Hungarian Method is used to solve
A. A transportation problem
B. A travelling salesman problem
C. A LP problem
D. Both a & b
16. A solution can be extracted from a model either by

A. Conducting experiments on it
B. Mathematical analysis
C. Both A and B
D. Diversified Techniques
17. OR uses models to help the management to determine its

A. Policies
B. Actions
C. Both A and B
18. What have been constructed from OR problems an methods for solving the models that
are available in many cases?
A. Scientific Models
B. Algorithms
C. Mathematical Models
19. Which technique is used in finding a solution for optimizing a given objective, such as
profit maximization or cost reduction under certain constraints?
A. Quailing Theory
B. Waiting Line
C. Both A and B
D. Linear Programming
20. What enables us to determine the earliest and latest times for each of the events and
activities and thereby helps in the identification of the critical path?
A. Programme Evaluation
B. Review Technique (PERT)
C. Both A and B
D. Deployment of resources
21. OR techniques help the directing authority in optimum allocation of various limited
resources like
A. Men and Machine
B. Money
C. Material and Time
D. All of the above
22. The Operations research technique which helps in minimizing total waiting and service
costs is
A. Queuing Theory
B. Decision Theory
C. Both A and B
UNIT II
LINEAR PROGRAMMING PROBLEMS
23. What is the objective function in linear programming problems?

A. A constraint for available resource
B. An objective for research and development of a company
C. A linear function in an optimization problem
D. A set of non-negativity conditions
24. Which statement characterizes standard form of a linear programming problem?

A. Constraints are given by inequalities of any type
B. Constraints are given by a set of linear equations
C. Constraints are given only by inequalities of >= type
D. Constraints are given only by inequalities of <= type
25. Feasible solution satisfies

A. Only constraints
B. only non-negative restriction
C. [a] and [b] both
D. [a],[b] and Optimum solution
26. In Degenerate solution value of objective function .

A. increases infinitely
B. basic variables are nonzero
C. decreases infinitely
D. One or more basic variables are zero
27. Minimize Z =
A. –maximize(Z)
B. -maximize(-Z)
C. maximize(-Z)
D. none of the above
28. In graphical method the restriction on number of constraint is .
A. 2
B. not more than 3
C. 3
29. In graphical representation the bounded region is known as region.

A. Solution
B. basic solution
C. feasible solution
D. optimal
30. Graphical optimal value for Z can be obtained from

A. Corner points of feasible region
B. Both a and c
C. corner points of the solution region
31. In LPP the condition to be satisfied is

A. Constraints have to be linear
B. Objective function has to be linear
C. none of the above
D. both a and b
State True or False:

32. Objective function in Linear Programming problems has always finite value at the
optimal solution-TRUE
33. A finite optimal solution can be not unique- FALSE
34. Feasible regions are classified into bounded, unbounded, empty and multiple: TRUE
35. Corner points of a feasible region are located at the intersections of the region and
coordinate axes: TRUE
36. Identify the type of the feasible region given by the set of inequalities
x - y <= 1
x - y >= 2
where both x and y are positive.
A. A triangle
B. A rectangle
C. An unbounded region
D. An empty region
37. Consider the given vectors: a(2,0), b(0,2), c(1,1), and d(0,3). Which of the following
vectors are linearly independent?
A. a, b, and c are independent
B. a, b, and d are independent
C. a and c are independent
D. b and d are independent
38. Consider the linear equation

2 x1 + 3 x2 - 4 x3 + 5 x4 = 10
How many basic and non-basic variables are defined by this equation?
A. One variable is basic, three variables are non-basic
B. Two variables are basic, two variables are non-basic
C. Three variables are basic, one variable is non-basic
D. All four variables are basic
39. The objective function for a minimization problem is given by

z = 2 x1 - 5 x2 + 3 x3
The hyperplane for the objective function cuts a bounded feasible region in the space
(x1,x2,x3). Find the direction vector d, where a finite optimal solution can be reached.
A. d(2,-5,3)
B. d(-2,5,-3)
C. d(2,5,3)
D. d(-2,-5,-3)
40. The feasible region of a linear programming problem has four extreme points: A(0,0),
B(1,1), C(0,1), and D(1,0). Identify an optimal solution for minimization problem with
the objective function z = 2 x - 2 y
A. A unique solution at C
B. A unique solutions at D
C. An alternative solution at a line segment between A and B
D. An unbounded solution
41. Degeneracy occurs when

A. Basic variables are positive but some of non-basic variables have negative values
B. The basic matrix is singular, it has no inverse
C. Some of basic variables have zero values
D. Some of non-basic variables have zero values
42. Linear programming is a

(a) Constrained optimization technique
(b) Technique for economic allocation of limited resources.
(c) Mathematical techniques
(d) All of the above
43. Constraints in an LP model represents

(a) Limitation
(b) Requirements
(c) Balancing limitations and requirements
44. The distinguished feature of an LP model is

(a) Relationship among all variable is linear
(b) It has single objective function and constraints
(c) Value of decision variables is non-negative
45. Alternative solution exist of an LP model when

(a) One of the constraints is redundant
(b) Objective function equation is parallel to one of the
(c) Two constrains are parallel
46. In the optimal simplex table,

Cj -Zj value indicates
(a) Unbounded solution
(b) Cycling
(c) Alternative solution
(d) None of these
47. For a maximization problem, objective function coefficient for an artificial variable is
(a) + M
(b) -M
(c) Zero
(d) None of these
48. If an optimal solution is degenerate, then

(a) There are alternative optimal solution
(b) The solution is infeasible
(c) The solution is use to the decis ion maker
(d) None of these
49. If a primal LP problem has finite solution, then the dual LP problem should have
(a) Finite solution
(b) Infeasible solution
(c) Unbounded solution
(d) None of these

(a) Dummy allocation needs to be added
(b) The problem has no feasible solution
(c) The multiple optimal solution exists.
(d) (a) and (b) only
51. When the total supply is not equal to total demand in a transportation problem then it is
called
(a) Balanced
(b) Unbalanced
(e) Degenerate
(d) None of these
52. The solution to a transportation problem with m-rows and n-columns is feasible if number
of positive allocations are
(a) m + n
(b) m *n
(c) m+n-l
(d) m+n+l
GAME THEORY
53. A firm that considers the potential reactions of its competitors when it makes a decision
A. is referred to as a price leader.
B. is engaged in strategic behaviour.
C. is engaged in collusion.
D. is referred to as a barometric firm.
54. Which of the following is an example of strategic behaviour?

A. A firm builds excess capacity to discourage the entry of competitors.
B. A firm adopts the pricing behaviour of a dominant firm under the assumption that
other firms will do likewise.
C. Firms in an industry increase advertising expenditures to avoid losing market share.
D. All of the above are examples of strategic behaviour.
55. Which one of the following is a part of every game theory model?
A. Players
B. Payoffs
C. Probabilities
D. Strategies
56. In game theory, a choice that is optimal for a firm no matter what its competitors do is
referred to as
A. the dominant strategy.
B. the game-winning choice.
C. super optimal.
D. a gonzo selection.
57. Which of the following circumstances in an industry will result in a Nash equilibrium?
A. All firms have a dominant strategy and each firm chooses its dominant strategy.
B. All firms have a dominant strategy, but only some choose to follow it.
C. All firms have a dominant strategy, and none choose it.
D. None of the above is correct.
58. Which of the following describes a Nash equilibrium?

A. A firm chooses its dominant strategy, if one exists.
B. Every competing firm in an industry chooses a strategy that is optimal given the
choices of every other firm.
C. Market price results in neither a surplus nor a shortage.
D. All firms in an industry are earning zero economic profits.
59. A prisoners' dilemma is a game with all of the following characteristics except one.
Which one is present in a prisoners' dilemma?
A. Players cooperate in arriving at their strategies.
B. Both players have a dominant strategy.
C. Both players would be better off if neither chose their dominant strategy.
D. The payoff from a strategy depends on the choice made by the other player.
60. Which of the following legal restrictions, if enforced effectively, would be likely to solve
a prisoners' dilemma type of problem for the firms involved?
A. A law that prevents a cartel from enforcing rules against cheating.
B. A law that makes it illegal for oligopolists to engage in collusion.
C. A law that prohibits firms in an industry from advertising their services.
D. All of the above would be likely to solve a prisoners' dilemma for the firms.
61. Until recently, medical doctors and lawyers have been prohibited from engaging in
competitive advertising. If the prisoners' dilemma applies to this situation, then the
presence of this restriction would be likely to
A. increase profits earned by individuals in these professions.
B. reduce profits earned by individuals in these professions.
C. have no effect on the profits earned by individuals in these professions.
D. increase the profits of some and reduce the profits of other individuals in these
professions.
62. Which one of the following conditions is required for the success of a tit-for-tat strategy?
A. Demand and cost conditions must change frequently and unpredictably.
B. The number of oligopolists in the industry must be relatively small.
C. The game can be repeated only a small number of times.
D. Firms must be unable to detect the behavior of their competitors.
63. A firm may decide to increase its scale so that it has excess production capacity because,
by doing so, it is able to
A. minimize its average cost of production.
B. establish a credible deterrent to the entry of competing firms.
C. take advantage of a dominant strategy in a prisoners' dilemma.
D. attain a Nash equilibrium and avoid repeated games.
64. Game theory is concerned with

A. predicting the results of bets placed on games like roulette.
B. the choice of an optimal strategy in conflict situations.
C. utility maximization by firms in perfectly competitive markets.
D. the migration patterns of caribou in Alaska.
65. Which of the following is an example of a game theory strategy?

A. You scratch my back and I’ll scratch yours.
B. If the shoe fits, wear it.
C. Monkey see, monkey do.
D. None of the above.
66. In game theory, a situation in which one firm can gain only what another firm loses is
called a
A. nonzero-sum game.
B. prisoners’ dilemma.
C. zero-sum game.
D. cartel temptation.
67. Which of the following is a nonzero-sum game?

A. Prisoners’ dilemma
B. Chess
C. Competition among duopolists when market share is the payoff
D. All of the above.
68. A plan of action that considers the reactions of rivals is an example of

A. accounting liability.
B. strategic behaviour.
C. accommodating behaviour.
D. risk management.
69. In game theory, the outcome or consequence of a strategy is referred to as the

A. payoff.
B. penalty.
C. reward.
D. end-game strategy.
70. A strategy that is best regardless of what rival players do is called

A. first-mover advantage.
B. a Nash equilibrium strategy.
C. tit-for-tat.
D. a dominant strategy.
71. A game that involves interrelated decisions that are made over time is a
A. sequential game.
B. repeated game.
C. zero-sum game.
D. nonzero-sum game.
72. A game that involves multiple moves in a series of identical situations is called a
A. sequential game.
B. repeated game.
C. zero-sum game.
D. nonzero-sum game.
73. Sequential games can be solved using

A. tit-for-tat.
B. dominated strategies.
C. backward induction.
D. risk averaging.
74. A firm that is threatened by the potential entry of competitors into a market builds excess
production capacity. This is an example of
A. a prisoners’ dilemma.
B. collusion.
C. a credible threat.
D. tit-for-tat.
75. What is the fundamental purpose of game theory?

A. To analyse decision-making
B. To analyse strategic interactions
C. To predict decision outcomes
D. To predict firm behaviour
UNIT III
ASSIGNMENT PROBLEM
76. An assignment problem is considered as a particular case of a transportation problem

because
A. The number of rows equals columns
B. All xij= 0 or 1
C. All rim conditions are 1
D. All of the above
77. An optimal assignment requires that the maximum number of lines that can be drawn
through squares with zero opportunity cost be equal to the number of
A. Rows or columns
B. Rows & columns
C. Rows + columns –1 d.
78. While solving an assignment problem, an activity is assigned to a resource through a

square with zero opportunity cost because the objective is to
A. Minimize total cost of assignment
B. Reduce the cost of assignment to zero
C. Reduce the cost of that particular assignment to zero
D. All of the above
79. The method used for solving an assignment problem is called

A. Reduced matrix method
B. MODI method
C. Hungarian method
80. The purpose of a dummy row or column in an assignment problem is to

A. Obtain balance between total activities &total resources
B. Prevent a solution from becoming degenerate
C. Provide a means of representing a dummy problem
81. Maximization assignment problem is transformed into a minimization problem by

A. Adding each entry in a column from the maximization value in that column
B. Subtracting each entry in a column from the maximum value in that column
C. Subtracting each entry in the table from the maximum value in that table
D. Any one of the above
82. If there were n workers & n jobs there would be

A. n! solutions
B. (n-1)! solutions
C. (n!)nsolutions
D. n solutions
83. An assignment problem can be solved by

A. Simplex method
B. Transportation method
C. Both a & b
84. For a salesman who has to visit n cities which of the following are the ways of his tour
plan
A. n!
B. (n+1)!
C. (n-1)!
D. n
85. The assignment problem

A. Requires that only one activity be assigned to each resource
B. Is a special case of transportation problem
C. Can be used to maximize resources
D. All of the above
86. An assignment problem is a special case of transportation problem, where

A. Number of rows equals number of columns
B. All rim conditions are 1
C. Values of each decision variable is either 0 or 1
D. All of the above
87. Every basic feasible solution of a general assignment problem, having a square pay-off
matrix of order, n should have assignments equal t
A. 2n+1
B. 2n-1
C. m+n-1
D. m+n
88. To proceed with the MODI algorithm for solving an assignment problem, the number of
dummy allocations need to be added are
A. n
B. 2n
C. n-1
D. 2n-1
89. The Hungarian method for solving an assignment problem can also be used to solve
A. A transportation problem
B. A travelling salesman problem
C. A LP problem
D. Both a & b
90. An optimal solution of an assignment problem can be obtained only if

A. Each row & column has only one zero element
B. Each row & column has at least one zero element
C. The data is arrangement in a square matrix
91. Which method usually gives a very good solution to the assignment problem?
A. northwest corner rule
B. Vogel's approximation method
C. MODI method
D. stepping-stone method
92. In applying Vogel's approximation method to a profit maximization problem, row and
column penalties are determined by:
A. finding the largest unit cost in each row or column.
B. finding the smallest unit cost in each row or column.
C. finding the sum of the unit costs in each row or column.
D. finding the difference between the two lowest unit costs in each row and column.
E. finding the difference between the two highest unit costs in each row and column.
93. The northwest corner rule requires that we start allocating units to shipping routes in the:
middle cell.
A. Lower right corner of the table.
B. Upper right corner of the table.
C. Highest costly cell of the table.
D. Upper left-hand corner of the table.
.
94. The table represents a solution that is:
A. an initial solution.
B. Infeasible.
C. degenerate.
D. all of the above
E. none of the above
95. Which of the following is used to come up with a solution to the assignment problem?
A. MODI method
B. northwest corner method
C. stepping-stone method
D. Hungarian method
96. What is wrong with the following table?

A. The solution is infeasible.
B. The solution is degenerate.
C. The solution is unbounded.
D. Nothing is wrong.
E. The solution is inefficient in that it is possible to use fewer routes.
97. The solution presented in the following table is

A. infeasible.
B. degenerate.
C. unbounded.
D. Optimal.
98. The solution shown was obtained by Vogel's approximation. The difference between the
objective function for this solution and that for the optimal is
A. 40
B. 60
C. 80
D. 100
99. Optimal solution of an assignment problem can be obtained only if

A. Each row & column has only one zero element
B. Each row & column has at least one zero element
100. In assignment problem of maximization, the objective is to maximise

A. Profit
B. optimization
C. cost
UNIT IV
TRANSPORTATION PROBLEMS
101. What is the difference between minimal cost network flows and transportation
problems?
A. The minimal cost network flows are special cases of transportation problems
B. The transportation problems are special cases of the minimal cost network flows
C. There is no difference
D. The transportation problems are formulated in terms of tableaus, while the minimal
cost network flows are formulated in terms of graphs
102. With the transportation technique, the initial solution can be generated in any fashion
one chooses. The only restriction is that
A. the edge constraints for supply and demand are satisfied.
B. the solution is not degenerate.
C. the solution must be optimal.
D. one must use the northwest-corner method.
103. The purpose of the stepping-stone method is to

A. develop the initial solution to the transportation problem.
B. assist one in moving from an initial feasible solution to the optimal solution.
C. determine whether a given solution is feasible or not.
D. identify the relevant costs in a transportation problem.
104. The purpose of a dummy source or dummy destination in a transportation problem is

to
A. prevent the solution from becoming degenerate.
B. obtain a balance between total supply and total demand.
C. make certain that the total cost does not exceed some specified figure.
D. provide a means of representing a dummy problem.
105. Which of the following is NOT needed to use the transportation model?
A. the cost of shipping one unit from each origin to each destination
B. the destination points and the demand per period at each
C. the origin points and the capacity or supply per period at each
D. degeneracy
106. Which of the following is a method for improving an initial solution in a

transportation problem?
A. northwest-corner
B. intuitive lowest-cost
C. southeast-corner rule
D. stepping-stone
107. The transportation method assumes that

A. there are no economies of scale if large quantities are shipped from one source to
one destination.
B. the number of occupied squares in any solution must be equal to the number of rows
in the table plus the number of columns in the table plus 1.
C. there is only one optimal solution for each problem.
D. the number of dummy sources equals the number of dummy destinations.
108. An initial transportation solution appears in the table.

Factory
C D
Capacity
A 10 0 10
B 15 25 40
Warehouse
25 25 50
Demand
Can this solution be improved if it costs $5 per unit to ship from A to C; $7 per unit to ship
from A to D; $8 to ship from B to C; and $9 to ship from B to D?
A. Yes, this solution can be improved by $50.

B. Yes, this solution can be improved by $100.
C. No, this solution is optimal.
D. Yes, the initial solution can be improved by $10.
109. What is the cost of the transportation solution shown in the table?
W X Y Supply
$3 $5 $9
A 70
20 50 0
$5 $4 $7
B 30
0 30 0
$10 $8 $3
C 120
40 0 80
Demand 60 80 80 220
A. $1350
B. $1070
C. $1150
D. $1230
110. Which statement regarding this transportation table is best?

W X Y Supply
$3 $5 $9
A 70
20 50 0
$5 $4 $7
B 30
0 30 0
$10 $8 $3
C 120
40 0 80
Demand 60 80 80 220
A. The solution is degenerate.
B. This solution can be improved by shipping from C to X.
C. This solution would be improved by shipping from B to W.
D. This solution was developed using the northwest corner rule.
A. A dummy source and destination must be added if the number of rows plus columns
minus 1 is not equal to the number of filled squares.
B. Only squares containing assigned shipments can be used to trace a path back to
an empty square.
C. An improvement index that is a net positive means that the initial solution can be
improved.
D. Only empty squares can be used to trace a path back to a square containing an
assigned shipment
112. In a transportation problem, we must make the number of and

equal.
A. destinations; sources
B. units supplied; units demanded
C. columns; rows
D. positive cost coefficients; negative cost coefficients
E. warehouses; suppliers
113. or are used to "balance" an assignment or transportation

problem.
A. Destinations; sources
B. Units supplied; units demanded
C. Dummy rows; dummy columns
D. Large cost coefficients; small cost coefficients
E. Artificial cells; degenerate cells
114. The net cost of shipping one unit on a route not used in the current transportation
problem solution is called the .
A. change index
B. new index
C. MODI index
D. idle index
E. Improvement index
115. The procedure used to solve assignment problems wherein one reduces the original
assignment costs to a table of opportunity costs is called .
A. stepping-stone method
B. matrix reduction
C. MODI method
D. northwest reduction
E. simplex reduction
116. The method of finding an initial solution based upon opportunity costs is called
.
A. the northwest corner rule
B. Vogel's approximation
C. Johanson's theorem
D. Flood's technique
E. Hungarian method
117. An assignment problem can be viewed as a special case of transportation problem in

which the capacity from each source is and the demand at each destination is
.
A. 1; 1
B. Infinity; infinity
C. 0; 0
D. 1000; 1000
E. -1; -1
118. occurs when the number of occupied squares is less than the number of rows
plus
A. Degeneracy
B. Infeasibility
C. Unboundedness
D. Unbalance
E. Redundancy
119. Both transportation and assignment problems are members of a category of LP

problems called .
A. shipping problems
B. logistics problems
C. generalized flow problems
D. routing problems
E. network flow problems
120. The equation Ri + Kj = Cij is used to calculate .

A. an improvement index for the stepping-stone method
B. the opportunity costs for using a particular route
C. the MODI cost values (Ri, Kj)
D. the degeneracy index
E. optimality test
121. In case of an unbalanced problem, shipping cost coefficients of are assigned

to each created dummy factory or warehouse.
A. very high positive costs
B. very high negative costs
C. 10
D. zero
E. one
122. The initial solution of a transportation problem can be obtained by applying any
known method. However, the only condition is that
A. The solution be optimal
B. The rim conditions are satisfied
C. The solution not be degenerate
D. All of the above

A. Satisfy rim conditions
B. Prevent solution from becoming degenerate
C. Ensure that total cost does not exceed a limit
A. Total supply equals total demand
B. The solution so obtained is not feasible
C. The few allocations become negative
125. An alternative optimal solution to a minimization transportation problem exists

whenever opportunity cost corresponding to unused route of transportation is:
A. Positive & greater than zero
B. Positive with at least one equal to zero
C. Negative with at least one equal to zero
126. One disadvantage of using North-West Corner rule to find initial solution to the
transportation problem is that
A. It is complicated to use
B. It does not take into account cost of transportation
C. It leads to a degenerate initial solution
D. All of the above
127. The solution to a transportation problem with ‘m’ rows (supplies) & ‘n’ columns
(destination) is feasible if number of positive allocations are
A. m+n
B. m*n
C. m+n-1
D. m+n+1
A. Equal to zero
B. Most negative number
C. Most positive number
D. Any value
129. During an iteration while moving from one solution to the next, degeneracy may
occur when
A. The closed path indicates a diagonal move
B. Two or more occupied cells are on the closed path but neither of them represents a
corner of the path.
C. Two or more occupied cells on the closed path with minus sign are tied for lowest
circled value
D. Either of the above
130. The large negative opportunity cost value in an unused cell in a transportation table is
chosen to improve the current solution because
A. It represents per unit cost reduction
B. It represents per unit cost improvement
C. It ensure no rim requirement violation
131. The smallest quantity is chosen at the corners of the closed path with negative sign to
be assigned at unused cell because
A. It improve the total cost
B. It does not disturb rim conditions
C. It ensure feasible solution
D. All of the above
132. When total supply is equal to total demand in a transportation problem, the problem is
said to be
A. Balanced
B. Unbalanced
C. Degenerate
133. Which of the following methods is used to verify the optimality of the current solution
of the transportation problem
A. Least cost method
B. Vogel’s approximation method
C. Modified distribution method
D. All of the above

A. Dummy allocation(s) needs to be added
B. The problem has no feasible solution
C. The multiple optimal solution exist
D. a & b but not c
135. In a transportation problem, when the number of occupied routes is less than the
number of rows plus the number of columns -1, we say that the solution is:
A. Unbalanced.
B. Infeasible.
C. Optimal.
D. impossible.
E. Degenerate.
136. The only restriction we place on the initial solution of a transportation problem is that:
we must have nonzero quantities in a majority of the boxes.
A. all constraints must be satisfied.
B. demand must equal supply.
C. we must have a number (equal to the number of rows plus the number of columns
minus one) of boxes which contain nonzero quantities.
137. The initial solution of a transportation problem can be obtained by applying any
known method. However, the only condition is that
A. the solution be optimal
B. the rim condition are satisfied
C. the solution not be degenerate
D. all of the above

A. satisfy rim condition
B. prevent solution from becoming degenerate
C. ensure that total cost does not exceed a limit
D. all of the above
A. total supply equals total demand
B. the solution so obtained is not feasible
C. the few allocations become negative
140. An alternative optimal solution to a minimization transportation problem exists

whenever opportunity cost corresponding to unused routes of transportation is:
A. positive and greater than zero
B. positive with at least one equal to zero
C. negative with at least one equal to zero
D. all of the above
141. One disadvantage of using North-West Corner Rule to find initial solution to
the transportation problem is that
A. it is complicated to use
B. it does not take into account cost of transportation
C. it leads to degenerate initial solution
D. all of the above
' I '
Operations Research Simplified :Q: M CQ : Basics of Linear Programming Model

--
1) Term 'Linear' in LPP represents that
A) Parameters value remains constant during the planning

period
B) Relationship among all variables is linear
C) Value of decision variables is non-negative
D) It has single objective function & constraints

' I ,

--
2) The mathematical model of an LP problem is important

because
~ ) It helps in converting the verbal description & numerical data

into mathematical expression
0
B) Decision-makers prefer to work with formal models
C) It captures the relevant relationship among decision factors
D) It enables the use of algebraic technique

\ I ,

--
3) Linear programming is a
A) Constrained optimization technique
B) Technique for economic allocation of limited resources
C) Mathematical technique
D) All of these options

0
•Q
' I '.
-= -
-
\ I ,

--
4) The first step in formulating a linear programming

problem is
A) Plot a graph
B) Perform the sensitivity analysis
C) ldenti«fy and define the decision variables
D) Find out the redundant constraints

-•Q' .
I '-
=-
-
' I '

--
5} Constraints in LPP mean _ __
) Li ro itations are expressed in mathematical equalities ( or

inequalities)
B) Assumption
C) Goal is to be achieved
D) A function to be optimized
-' O'=
I , -
'
-
' I ,

--
6) Non-negativity restriction in LPP indicates that
A) All decision variables must take on values equal to or greater

0
than zero
B) A positive coefficient of variables in objective function
C) A positive coefficient of variables in any constraint
D) Non-negative value of resources

•Q'
SUBS RIBED • - -
I ' -
-
='
' I ,
v! 10 ~ J U 40 50 OU"l1
Operations Research Simplified :Q: M CQ ... -

, ,,
~~-~-
,,-+ .., = 100
·c a -. -
,-+,·= AA
o -· -·.....- . .. g Model
--
. • -
7) A feasible solution to an LP problem
A) Must satisfy all of the problem's constraints simultaneously

0
B) Need not satisfy all of the constraints, only some of them
C) Must be a corner point of the feasible region
D) Must optimize the value of the objective function
-•Q' .
I '•
-
-=
' I '

--
8) Which of the following is assumption of an LP model
A) Divis ibi Iity
B) Proportionality
C) Additivity
D) All of t J;lese
-•Q' .
I ' -
-
='
' I '

--
9) The linear function of the variables which is to be

maximize or minimize is called
A) Constraints
B) Obj~ctive function
C) Decision variable
D) Non-negativity constraint
•Q
' I
- -= - '•
-
\ I ,

--
10) Which of the following is NOT a characteristic of the LPP
A) Resources must be limited
B) Only one objective function

C) Parameters value remains constant during the planning
period
D) The problem must be of minimization type
0
•Q
' I
- - '•
-
='
' I '
Operations Research Simplified :Q:

--
MCQ: LPP (Graphical Method)
1) In graphical method the restriction on number of decision

variables is •
)Two
B) Three
C) Not more then three
D) None pf these
' I '

--
2) In graphical method the restriction on number of constraint

•
IS _ _ _ _ _ •
A)Two
B) Three 0
C) Not more then three
D) None of these
' I '

-- MCQ: LPP (Graphical Method)
3} The region which satisfies all the constrains of the L.P.P. is called
as
--
) Feasible region 0
B) Infeasible region
C) Convex region
D) Concave region
\ I ,

--
4) Graphical optimal value for Z can be obtained from
orner points of the feasible region

0
B) Corner points of the infeasible region

C) Mid point of the feasible region
D) Mid point of the infeasible region
-•Q' .
I ' -
=-
' I '

5) The feasible solution of a L.P.P. belongs to
A) First and second quadrant
B) First and third quadrant
C) Second quadrant
D) Only in the first 6:l Uadrant
-•Q' .
I '•
=-
\ I ,

6) Alternative solution exist in a linear programming problem

when - - - -
A) one of the constraint is redundant
B) objective function is pa ioa llel to one of the constraints
C) two constraints are parallel
D) objective function is perpandicular to one of the constraints

'O
\
-=
I ' -
'
-
' I '

--
7) If the value of the objective function z can be increased or

decreased indefinitely, such solution is called ______
A) Bounded solution
B) Optimum solution
) Unbound ed solution
D) Feasible Solution
-•Q
'I
.' -
- -
Operations Research Simplified :t):
--
8) In following LPP solution optimum value of Z is at point

Maximize z • 4x • y subject to:- x • y ::50
y 3X + y ::gO
X?: o. y?: 0
go
A) (O,O)
Corner Point Corresponding value
80 3x • y • go
ofZ
70
60 C<o. 50) (O, O) 0
B) {30,0J
(30. O) 120
40
30
8(20. 30) (20. 30) uo C) {20,30)
(50, O) <o. 50> 50
20
x•
10 / D) (0,50)
40 0 70
107
Y' •Q
' I '•
A (30. o) x + y • 50 -= -
-
\ I ,

9) For the maximize function Z = X + V and constraints given by X +

V ~ 8 and 3X + SY S 15
A) There are two feasible regions
B) There are infinite feasible regions
) There is no feasible region

D) There is a bounded feasible region
-•Q' .
I ' -
=-
\ I ,

--
10) For the optimizing function Z = X + V and constraints given by

2X 1 + X2 S 30; X1 + X2 S 20 and X1 S 25
Which one is redundant constraint.
A) 2X 1 + X2 ~ 30
B) X1 + X2 ~ 20
) X1 ~ 25 0
D) None of these - .
•Q
' I '•
=-
\ I ,

--
MCQ : LPP Simplex and Big-M
1) Linear programming problem involving more than two variables

can be solved by
7\) Simplex method

B) Graphical method
C) Matrix minima method
D) Hungarian method
SUBS RIBEO A
\ I ,

--
2) The variable is added for the less than or equal to

(S) type of constraint
B) Surplus
C) Artificial
D) Basic
' I ,

--
3) The variable is used for the greater than or equal

to (~) type of constraint
A) Only Slack
B) Surplus0 and Artificial
C) Only Artificial
D) Basic
•Q
' I '•
- -= -
-
\ I ,

--
4) The coefficient of slack variable in the objective function is
A)-M
B) +M
D)l
\ I ,

--
5) Slack variables are assigned zero coefficient because
A) No contribution in the objective function

0
B) High contribution in the objective function

C) Basic contribution in the objective function
D) Minimum contribution in the objective function

' I ,

-- MCQ : LPP Simplex and Big-M
6) The role of artificial variables in the simplex method is
A) To aid in finding an initial solution
B) To find optimal dual prices in the final simplex table
C) To start with Big M method
D) All of t t, ese
SUBSCRIBED '•' -•o'=

I ' -
'
-
\ I ,

--
7) The coefficient of artificial variable in the objective function of

maximization problem is
A)-M
B) +M
C)O
D)l
-•Q' .
I '•
=-
' I ,

--
8) For a minimization problem, the objective function coefficient

for an artificial variable is
A)-M
0
B) +M
C)O
D}1
•Q
'
- -= -
I '-
-
\ I ,

--
9) For maximization LPP, the simplex method is terminated when

all values
B) cj + zj : ; o
C) Cj- Zj ~ 0
o) cj + zj ~ o
-•o\ .
I ' -
=-
\ I ,

--
10) In the simplex method the outgoing/leaving variable

is one with value of replacement ratio.
A) smal lest non-negative

B) smallest negative
C) largest
D) zero
-•Q' .
I '•
=--
-
MCQ : Assignment Problem
-
1) An assignment problem is considered as a particular case of a

0
A) Transportation problem
B) Sequencing problem
C) Queuing problem
D) Game theory
\ I ,

-- MCQ : Assignment Problem
2) The method used for solving an assignment problem is called
A) Simplex method
B) Least cost method

C) Hungarian method
D) Steppi ng stone method

' I '

--
4) While solving an assignment problem, an activity is

assigned to a resource with zero opportunity cost because
objective is to _ __
) rcn inimize total cost of assignment
B) reduce total cost of assignment to zero
C) reduce cost of that assignment to zero
D) maximize total cost of assignment •Q

' I
SUBSCRIBED ta.' -= ' -
'
-
' I '

--
5) In an assignment problem_ __
) Only one activity be assigned to each resource

0
B) Any number of activities can be assigned to each resource

C) It depends upon how many resources are available
D) First activity is assigned to first resource
-•Q' .
I ' -
-=-
--
6) An assignment problem can be viewed as a special case of

transportation problem in which the capacity from each source is
and the demand at each destination is .
---
0
A)one;one
B) unlimited; one
C) one; unlimited
D) unlimited; unlimited •Q
' I
- -= - '•
-
\ I ,

--
7) In marking assignments, which of the following should be

preferred?
A) Only row having single zero
B) Only column having single zero
)
C) Only row/column having single zero
D) Column having more than one zero

-•Q' . I ' -
-
:
' I '

-- MCQ : Assignment Problem
8) The assi~nment problem is always a _ _ _ _ _ _matrix.

A) circle
B) square
C) rectangle
D) triangle
-•Q' .
I ,•
=-
Operations Research Simplified :():
--
9) Maximization assignment problem is transformed into a

minimization problem by .
A) adding each entry in a column from the maximum value in that column
B subtracting each entry in a column from the maximum value in that column
adding each entry in the table from the r'n aximum value in that table
SUBSCRIBED 1
' -•Q' .
I ' -
=-
\ I ,

--
10) The assignment problem will have alternate solutions when
A) at least one zero in each row and column
B) when all rows have two zeros
) w hen there is a tie between zero opportunity cost cells

D) if two diagonal elements are zeros.
SUBSCRIBED 1
' -•Q' .
I , -
-=-
-
MCQ : Transportation Model
-
3} The transportation problem deals with the transportation of_
A) single product from a source to several destinations
B) several products from a source to a destination

C) single product from several sources to a destination
) several products from several sources

0
to several destinations
\ I ,

--
MCQ : Transportation Model
4) In northwest corner method first allocation is made at
A) Lower right corner of the table.
B) Upper right corner of the table.

C) Highest costly cell of the table.
D) Upper left-hand corner of the table. 0
-•Q' .
I '•
=-
-
MCQ: Queuing Model
-
1) In queuing system, _____ refers to those waiting in a

• • •
queue or rece1v1ng service
0
A) Service provider
B) Client
Customer
D) Patron
-
MCQ: Queuing Model
-
2) A queue is formed when the demand for a service
Exceed-S the capacity to provide that service

B) Is less than the capacity to provide that service
C) Is equal to the capacity to provide that service
D) There is no relation of service capacity and queue

-
MCQ: Queuing Model
-
3) Commonly assumed probability distribution of arrival pattern

•
IS
-------
) Poisson distribution °
B) Binomial distribution
C) Normal distribution
D) Beta distribution
-•Q
'
I
. , -
=-
- MCQ: Queuing Model
-
4) Commonly assumed probability distribution of service

pattern
A) Poisson distribution
B) Exponential distribution
C) Normal distribution
D) Beta distrj bution

-•o'=
I ' -
'
-
\ I ,

--
MCQ: Queuing Model
5) A customer's behavior of jumping from one queue to another

is called
------
A) Jockying
B) Reneging
0
C) Collusion
D) Balking
•Q
'
-=
I , -
'
-
-
MCQ: Queuing Model
-
6) The _ _ _ _ indicates the order in which members of

the queue are selected for service.
7\) Queue discipline
B) Arrival pattern
C) Service Pattern
D) Cu~ omer behaviour
-•Q' .
I ' -
:
-
\ I ,

--
MCQ: Queuing Model
7) Traffic intensity in Queuing Theory is also called _ __
A) Service factor
B) Arriva I factor
/ 0
';,,IC) Utilization factor

~
D) Consumption factor
-•Q
'
.
I '•
=-
\ I ,

-- MCQ: Queuing Model
8) A calling population is considered to be infinite when

A) The capacity of the system is infinite
B) Arrivals are dependent upon each other
C) All customers arrival at once
Arrivals are independent of each other

0
-•Q' .
I ' -
=-
\ I ,

-- MCQ: Queuing Model
9) In waiting line theory, number of customers waiting in the

queue is referred to as
A) Queuing system
B) Traffic intensity
) Queue length
D) System length
0
-•Q' .
I '•
=-
-
MCQ: Queuing Model
-
10) An M/D/5 system is a system with a
A) generic M channel system, exponential arrivals, and constant service time.
B) five channel system, Poisson arrivals, and normally distributed service time
C) five ct\p nnel system, Poisson arrivals and constant service time.
D) D channel system with Exponential arrivals and Poisson service times.
-•Q' .
I ' -
-
='
-
MCQ : Operations Research
-
1) Operations research is the application of _ _ _ __

methods to arrive at the optimal solutions to the problems.
A) Economical
B) Sci~ntific
C) Artistic
D) Rational
-
-
2) In operations research, the _ _ _ _ _ _ are prepared for

situations.
Mathematical models
B) Physical models
C) Iconic models
D) Diagrammatic models
0
- MCQ : Operations Research
-
4) Operation research approach is
A) Mu !ti-disciplinary
B) Artificia I
C) Intuitive
D) Limited to some fields

0
-•Q' .
I ' -
=-
\ I ,

--
5) Operation research analysts do not _ _ __
A) Predict future operation
B) Build models
C) Collect the relevant data
D) Recommend decision and accept

0
SUBSCRIBED
1
• ' -•o
' .I , -
=-
--
6) Which technique is used in finding a solution for optimizing a

given objective, such as profit maximization or cost reduction under
certain constraints?
A) Quailing Theory o
B) Network Analysis
C) Linear Programming
D) Sequencing Model •Q
-= -' I '•
-
-- MCQ : Operations Research
7) Operations Research is a very powerful tool for _ _ __

A) Operations
B) Research
C) Decision making
D) Simulation
0
SUBSCRIBED '*' •Q
-' I ' -
'
-
:
--
9) A model is _ _ __
A) An essence of reality
B) An approximation
C) An idealization
) Al I of the these
0
-•Q' .
I '•
-=-
Model Question paper
Operation Research Technique ANS
CLASS-BE MAX MARKS-60
TIME-90 MIN
Each question carry one marks
UNIT-I A
1. Operations Research approach is ______________.
A. multi-disciplinary
B. intuitive
C. collect essential data
2. Operations Research has the characteristics that it is done by a team D

of -----------------
A. Scientists
B. Mathematicians
C. Academics
D. All of the above
3. Operations Research was known as an ability to win a war without really going in to D
a -------------
A. Battle field
B. Fighting
C. War
D. Both A and B
4 . Operations Research is a ----------------- D
A. Science
B. Art
C. Mathematics
D. Both A and B
5. Which of the following is not the phase of OR methodology? D

A. Formulating a problem
B. Constructing a model
C. Establishing controls
D. Controlling the environment
6. Operations Research uses models to help the management to determine its C

_____________ scientifically
A. Policies
B. Actions
C. Both A and B
7. In a Linear Programming Problem functions to be maximized or minimized are B

called ______________.
A. constraints
B. objective function
C. basic solution
D. feasible solution
8. Mathematical model of linear programming problem is important because A

______________.
A. it helps in converting the verbal description and numerical data into

mathematical expression
B. decision makers prefer to work with formal models
C. it captures the relevant relationship among decision factors
D. it enables the use of algebraic technique
9. Graphical method of linear programming is useful when the number of decision B

variable are ______________.
A. 1
B. 2
C. 3
D. 4
10. This innovative science of Operations Research was discovered during ------------- C
A. Civil War
B. World War I
C. World War II
D. Industrial Revolution
11. The feasible solution of a L.P.P. belongs to D

A. First and second quadrant
B. First and third quadrant
C. Second quadrant
D. Only in the first quadrant
12. Operation research approach is typically based on the use of _______. B
A. physical model.
B. mathematical model.
C. iconic model.
D. descriptive model.
UNIT-II A
13.In maximization cases , ---------- - are assigned to the artificial variables as their
coefficients in the objective function
A. + M
B. -M
C. Zero
D. None of these
14. Key element is also known as ______________. D
A. slack
B. surplus
C. artificial
D. pivot
15. ______________ is a mathematical technique used to solve the problem of A
allocating limited resource among the competing activities.
A. Linear Programming problem
B. Assignment Problem
C. Replacement Problem
D. Non-linear Programming Problem
16. If the given Linear Programming Problem is in its standard form then primal- B
dual pair is ______________.
A. symmetric
B. un symmetric
C. square
D. triangle
17. Feasible solution satisfies __________ C
A. Only constraints
B. only non-negative restriction
C. A and B both
D. Optimum solution
18. In simplex method, we add ---------------- variables in the case of ‘=’ C
A. Slack Variable
B. Surplus Variable
C. Artificial Variable
19.The dual of the dual is ______________. D
A. dual-primal
B. primal-dual
C. dual
D. primal
20. The first step in formulating a linear programming problem is D
A) Identify any upper or lower bound on the decision variables
B) State the constraints as linear combinations of the decision variables
C) Understand the problem
D) Identify the decision variables
21. Linear Programming Problem is a technique of finding the ______________. A
A. optimal value
B. approximate value
C. initial value
D. infeasible value
22. . The cost of a slack variable is _________. A
A. 0
B. 1
C. 2
D. -1
23. The cost of a surplus variable is _________. A
A. 0
B. 1
C. 2
D. -1
24 Which of the terms is not used in a linear programming problem C

A. Slack variables
B. Objective function
C. Concave region
D. Feasible solution
UNIT-III D
25 Optimal solution of an assignment problem can be obtained only if
A. Each column has only one zero element
B. Each row has at least one zero element
26. The assignment algorithm was developed by ______________ method. A
A. HUNGARIAN
B. VOGELS
C. MODI
D. TRAVELING SALES MAN
27. The solution to a transportation problem with m-sources and n-destinations is D

feasible if the numbers of allocations are ______________.
A. m+n
B. mn
C. m-n
D. m+n-1
28. The assignment problem is always a ______________matrix. B
A. circle
B. square
C. rectangle
D. triangle
29. Maximization assignment problem is transformed into a minimization problem C

by______________.
A. adding each entry in a column from the maximum value in that column
B. subtracting each entry in a column from the maximum value in that column
C. subtracting each entry in the table from the maximum value in that table
D. adding each entry in the table from the maximum value in that table
30 If a transportation problem has four origins and five destinations, the LP B

formulation of the problem will have
A.5 constraints
B.9 constraints
C.18 constraints
D.20 constraints
31. When the total demand is equal to supply then the transportation problem is said A
to be ______________.
A. balanced
B. unbalanced
C. maximization
D. minimization
32. For finding an optimum solution in transportation problem ______________ C

method is used.
A. Simplex
B. Big-M
C. MODI method
D. Hungarian
33. The assignment problem is a special case of transportation problem in which D

______________.
A. number of origins are less than the number of destinations
B. number of origins are greater than the number of destinations
C. number of origins are greater than or equal to the number of destinations
D. number of origins equals the number of destinations
34. In the transportation table, empty cells will be called ______________. B
A. occupied
B. unoccupied
C. no
D. finite
35. The similarity between assignment problem and transportation problem is D

______________.
A. both are rectangular matrices
B. both are square matrices
C. both can be solved y graphical method
D. both have objective function and non-negativity constraints
36.In assignment problem of maximization, the objective is to maximise— A
A. Profit
B. optimization
C. cost
UNIT-IV D
37 A mixed strategy game can be solved by ______________.
A. Matrix method
B. Graphical method
C. Algebraic method
D. All of the above
38.When the sum of gains of one player is equal to the sum of losses to another C
player in a game, this situation is known as ______________.
A. two-person game
B. prisoners’ dilemma.
C. zero-sum game
D. non-zero-sum game
39. A type of decision- making environment is ---- D
A. certainty
B. risk
C. uncertainty
D. all of the above
40. Which of the following describes a Nash equilibrium? B

A. A firm chooses its dominant strategy, if one exists.
B. Every competing firm in an industry chooses a strategy that is optimal given the
choices of every other firm.
C. Market price results in neither a surplus nor a shortage.
D. All firms in an industry are earning zero economic profits.
41. A game is said to be fair if ______________. A
A. lower and upper values are zero
B. only lower value to be zero
C. only upper value to be zero
D. lower and upper values are not equal to zero
42.In game theory, the outcome or consequence of a strategy is referred to as the— A
A. payoff.
B. penalty.
C. reward.
D. end-game strategy.
43.What happens when minimax and maximin values of the game are same? C
A. No solution exists
B. Solution is mixed
C. Saddle point exists
44.For analyzing the problem , decision – makers should normally study – A
A. Its qualitative aspects
B. Its quantitative aspects
C. Both A and B
D. Neither A and B
45. _____________is used to reduce the game. D
A. Transportation Problem
B. Assignment Problem
C. Dual simplex method
D. Graphical Method
46 In a mixed strategy game A
A. No saddle points exists
B. each player always selects same strategy
C. Each player always selects same strategy without considering other player’s choice
D. all of the above
47. Which of the following is a zero-sum game? B
A. Prisoners' dilemma
B. Chess
C. A cartel member's decision regarding whether or not to cheat
D. All of the above.
48. Which theory concerns making sound decisions under conditions of certainty, risk C
and uncertainty?
A. Game Theory
B. Network Analysis
C. Decision Theory
UNIT-V A
49. The problem of replacement is felt when job performing units fail
______________.
A. suddenly and gradually
B. gradually
C. suddenly
D. neither gradually nor suddenly
50. The group replacement policy is suitable for identical low cost items which are C
likely to ______________.
A. fail suddenly
B. fail completely and suddenly
C. fail over a period of time
D. be progressive and retrogressive
51. The average annual cost will be minimized by replacing a machine when_____. A
A. average cost to date is equal to the current maintenance cost
B. average cost to date is greater than the current maintenance cost
C. average cost to date is less than the current maintenance cost.
D. next year running cost in more than average cost of nth year
52. In 2 jobs by m machine sequencing, a line at 45° represents: D
A. Job 1 is idle.
B. Job 2 is idle.
C. Both jobs are idle.
D. No job is idle.
53. In sequencing, an optimal path is one that minimizes A
A. Elapsed time
B. Idle time,
C. Processing time
D. Ready time.
54. The objective of sequencing problem is ______. C
A. To find the order in which jobs are to be made
B. To find the time required for completing all the jobs on hand.
C. To find the sequence in which jobs on hand are to be processed to

minimize the total time required for processing the jobs.
D. To maximize the effectiveness.
55. If there are ‘n’ jobs and ‘m’ machines, there will be _____ sequences of doing the B
jobs.
A. n × m
B. (n!) m
C. n m
D. none of above.
56. In solving 2 machine and ‘n’ jobs, the following assumption is wrong: D
A. No passing is allowed
B. Processing times are known,
C. Handling time is negligible,
D. The time of processing depends on the order of machining.
57. The following is one of the assumptions made while sequencing ‘n’ jobs on 2 D
machines:
A. Two jobs must be loaded at a time on any machine.
B. Jobs are to be done alternatively on each machine.
C. The order of completing the jobs has high significance.
D. Each job once started on a machine is to be performed up to completion on that
machine.
58 In jobs A to E have process times as 5, 1, 9, 3,10 on first machine and2, 6, 7, 8,4 on D

second machine, then the optimal sequence is:
A. ECDAB
B. ABCDE
C. BCDEA
D.BDCEA.
59. In jobs A to D have process times as 5, 6, 8, 4 on first machine and 4, 7, 9, 10 on D

second machine, then the optimal sequence is:
A. CDAB
B. ABCD
C. BCDA
D. DBCA.
60. What is concerned with the prediction of replacement costs and determination of B
the most economic replacement policy?
A. Search Theory
B. Theory of replacement
C. Probabilistic Programming
D None of the above

Multiple Choice Questions Decision Science

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Multiple Choice Questions Decision Science

Uploaded by

Copyright:

Available Formats

MULTIPLE CHOICE QUESTIONS

1. Decision Science approach is

DECISION SCIENCE - ANSWER KEY

1. Operations Research approach is ______________.

collect essential data

Correct answer: (A)

2. A feasible solution to a linear programming problem ______________.

must satisfy all the constraints of the problem simultaneously

need not satisfy all of the constraints, only some of them

must be a corner point of the feasible region.

must optimize the value of the objective function

Correct answer: (A)

must satisfy all the constraints of the problem simultaneously

Correct answer: (B)

4. For any primal problem and its dual______________.

optimal value of objective function is same

primal will have an optimal solution iff dual does too

both primal and dual cannot be infeasible

Correct answer: (C)

primal will have an optimal solution iff dual does too

Correct answer: (A)

rows and columns.

Correct answer: (A)

8. Select the correct statement

EOQ is that quantity at which price paid by the buyer is minimum

Total ordering cost equals holding cost

Stock out cost is never permitted

Correct answer: (C)

Total ordering cost equals holding cost

9. Service mechanism in a queuing system is characterized by ______________.

customers in the system

server in the system

Correct answer: (B)

10. The objective of network analysis is to______________.

minimize total project duration

minimize toal project cost

minimize production delays, interruption and conflicts

maximize total project duration

Correct answer: (A)

minimize total project duration

it has got finite non-negative error

it need not be symmetrical about model value

the project is progressing well

Correct answer: (A)

Correct answer: (C)

13. The calling population is considered to be infinite when ______________.

all customers arrive at once

capacity of the system is infinite

service rate is faster than arrival rate

arrivals are independent of each other

Correct answer: (B)

capacity of the system is infinite

14. In marking assignments, which of the following should be preferred?

Only row having single zero

Only column having single zero

Only row/column having single zero

Correct answer: (C)

Only row/column having single zero

Correct answer: (B)

16. If the order quantity (size of order) is increased, ______________

holding costs decrease and ordering costs increase

holding costs increase and ordering costs decrease

the total costs increase and then decrease