OR Multiple Choice
OR Multiple Choice
https://www.mbamcq.com/operations-research/
OPERATIONS RESEARCH
Multiple Choice Questions
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
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
STUDY MATERIAL SEM VI TYBMS
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
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
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
D. None of the above
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
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
D. None of the above
UNIT II
LINEAR PROGRAMMING PROBLEMS
27. Minimize Z =
A. –maximize(Z)
B. -maximize(-Z)
C. maximize(-Z)
D. none of the above
STUDY MATERIAL SEM VI TYBMS
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?
STUDY MATERIAL SEM VI TYBMS
40. 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
41. 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.
44. 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
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.
F. Destinations; sources
G. Units supplied; units demanded
H. Dummy rows; dummy columns
STUDY MATERIAL SEM VI TYBMS
49. The net cost of shipping one unit on a route not used in the current transportation
problem solution is called the .
K. change index
L. new index
M. MODI index
N. idle index
O. Improvement index
STUDY MATERIAL SEM VI TYBMS
50. 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
51. The method of finding an initial solution based upon opportunity costs is called
.
F. the northwest corner rule
G. Vogel's approximation
H. Johanson's theorem
I. Flood's technique
J. Hungarian method
53. occurs when the number of occupied squares is less than the number of rows
plus
P. Degeneracy
Q. Infeasibility
R. Unboundedness
S. Unbalance
T. Redundancy
57. The initial solution of a transportation problem can be obtained by applying any
known method. However, the only condition is that
F. The solution be optimal
G. The rim conditions are satisfied
H. The solution not be degenerate
I. All of the above
59. The occurrence of degeneracy while solving a transportation problem means that
N. Total supply equals total demand
O. The solution so obtained is not feasible
P. The few allocations become negative
Q. None of the above
61. One disadvantage of using North-West Corner rule to find initial solution to
the transportation problem is that
V. It is complicated to use
STUDY MATERIAL SEM VI TYBMS
62. 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
63. If an opportunity cost value is used for an unused cell to test optimality, it should be
E. Equal to zero
F. Most negative number
G. Most positive number
H. Any value
64. During an iteration while moving from one solution to the next, degeneracy may
occur when
B. The closed path indicates a diagonal move
C. Two or more occupied cells are on the closed path but neither of them represents a
corner of the path.
D. Two or more occupied cells on the closed path with minus sign are tied for
lowest circled value
E. Either of the above
65. 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
D. None of the above
66. The smallest quantity is chosen at the corners of the closed path with negative sign to
be assigned at unused cell because
F. It improve the total cost
G. It does not disturb rim conditions
H. It ensure feasible solution
I. All of the above
67. When total supply is equal to total demand in a transportation problem, the problem
is said to be
A. Balanced
STUDY MATERIAL SEM VI TYBMS
B. Unbalanced
C. Degenerate
D. None of the above
68. 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
70. 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:
I. Unbalanced.
J. Infeasible.
K. Optimal.
L. impossible.
M. Degenerate.
71. 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.
N. all constraints must be satisfied.
O. demand must equal supply.
P. we must have a number (equal to the number of rows plus the number of
columns minus one) of boxes which contain nonzero quantities.
Q. None of the above
72. The initial solution of a transportation problem can be obtained by applying any
known method. However, the only condition is that
R. the solution be optimal
S. the rim condition are satisfied
T. the solution not be degenerate
U. all of the above
74. 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
D. none of the above
76. One disadvantage of using North-West Corner Rule to find initial solution to
the transportation problem is that
I. it is complicated to use
J. it does not take into account cost of transportation
K. it leads to degenerate initial solution
L. all of the above
A. 5
B. 10
C. 15
D. 20
View answer A
78. Graphical method of linear programming is useful when the number of decision
variable are
A. 2
B. 3
C. 4
D. 5
View answer A
STUDY MATERIAL SEM VI TYBMS
A. 0
B. 1
C. 2
D. -1
View answer A
A. dual-primal
B. primal-dual
C. dual
D. primal
View answer D
A. unbounded
B. bounded
C. optimum solution
D. no solution
View answer C
82. When the total demand is not equal to supply then it is said to be .
A. balanced
B. unbalanced
C. maximization
D. minimization
View answer B
A. 1
B. 2
C. 3
D. 4
View answer B
STUDY MATERIAL SEM VI TYBMS
84. If the primal has an unbound objective function value then the dual has
.
A. solution
B. basic solution
C. basic feasible solution
D. no feasible solution
View answer D
A. bounded
B. unbounded
C. no solution
D. alternative solution
View answer B
View answer D
87. If all aij values in the entering variable column of the simplex table are negative,
then .
A. solution is unbounded
B. solution is degenerate
C. there exist no solution
D. there are multiple solutions
View answer A
View answer B
A. feasible region
B. basic solution
C. non feasible region
D. optimum basic feasible solution
View answer A
A. total
B. free
C. independent
D. interference
View answer A
91. occurs when the number of occupied squares is less than the number
of rows plus
A. Degeneracy
B. Infeasibility
C. Unboundedness
D. Unbalance
View answer A
A. A transportation problem
B. A travelling salesman problem
C. A LP problem
D. Both a & b
View answer B
STUDY MATERIAL SEM VI TYBMS
A. Profit
B. optimization
C. cost
D. Loss
View answer A
A. increases infinitely
B. basic variables are nonzero
C. decreases infinitely
D. One or more basic variables are zero
View answer D
A. 2
B. not more than 3
C. 3
D. none of the above
View answer D
A. Solution
B. basic solution
C. feasible solution
D. optimal
View answer C
View answer D
STUDY MATERIAL SEM VI TYBMS
A. mathematical models
B. physical models diagrammatic
C. diagrammatic models
D. all of above
View answer A
99. 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
View answer B
A. Suitable manpower
B. mathematical techniques, models, and tools
C. Financial operations
D. all of above
View answer B
A. multi-disciplinary
B. scientific
C. intuitive
D. collect essential data
3. If any value in XB column of final simplex table is negative, then the solution is
______________.
A. infeasible
B. infeasible
C. bounded
D. no solution
5. The difference between total float and head event slack is ______________
A. free float
B. independent float
C. interference float
D. linear 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 ______________.
A. rows or columns
B. rows and columns.
C. Rows + columns- 1
D. rows-columns.
STUDY MATERIAL SEM VI TYBMS
7. To proceed with the Modified Distribution method algorithm for solving an transportation
problem, the number of dummy allocations need to be added are______________.
A. n
B. n-1
C. 2n-1
D. n-2
A. customers behavior
B. servers behavior
C. customers in the system
D. server in the system
11. In program evaluation review technique network each activity time assume a beta
distribution because______________.
12. If there is no non-negative replacement ratio in solving a Linear Programming Problem then
the solution is ______________.
A. feasible
B. bounded
C. unbounded
D. infinite
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 ______________.
A. 3/5
B. 4/5
C. 5/3
D. 6/5
17. ______________ is a mathematical technique used to solve the problem of allocating limited
resource among the competing activities
A. Simplex method
B. Hungarian method
C. Graphical method
D. Degeneracy
19. The activity cost corresponding to the crash time is called the ______________.
A. critical time
STUDY MATERIAL SEM VI TYBMS
B. normal time
C. cost slope
D. crash cost
A. convex
B. polygon
C. triangle
D. bold
A. constraints
B. objective function
C. basic solution
D. feasible solution
22. If the primal problem has n constraints and m variables then the number of constraints in the
dual problem is ______________.
A. mn
B. m+n
C. m-n
D. m/n
A. shadow cost
B. opportunity cost
C. slack variable
D. surplus variable
STUDY MATERIAL SEM VI TYBMS
A. slack
B. surplus
C. artificial
D. pivot
25. The solution to a transportation problem with m-sources and n-destinations is feasible if the
numbers of allocations are ______________.
A. m+n
B. mn
C. m-n
D. m+n-1
26. The allocation cells in the transportation table will be called ______________ cell
A. occupied
B. unoccupied
C. no
D. finite
27. To resolve degeneracy at the initial solution, a very small quantity is allocated in
______________ cell
A. occupied
B. unoccupied
C. no
D. finite
A. HUNGARIAN
B. VOGELS
STUDY MATERIAL SEM VI TYBMS
C. MODI
D. TRAVELING SALES MAN
A. transportation Problem
B. assignment Problem
C. travelling salesman problem
D. replacement Problem
30. The coefficient of slack\surplus variables in the objective function are always assumed to be
______________.
A. 0
B. 1
C. M
D. -M
A. Simplex
B. Dual simplex
C. Big M
D. Modi
32. The customers of high priority are given service over the low priority customers is
______________.
A. Pre emptive
B. FIFO
C. LIFO
D. SIRO
STUDY MATERIAL SEM VI TYBMS
33. A queuing system is said to be a ______________ when its operating characteristic are
independent upon time
34. An activity which does not consume neither any resource nor time is known as
______________.
A. predecessor activity
B. successor activity
C. dummy activity
D. activity
A. total
B. free
C. independent
D. interference
36. The number of time estimates involved in Program Evaluation Review Technique problem is
______________.
A. 1
B. 2
C. 3
D. 4
A. circle
B. square
C. rectangle
D. triangle
39. If the net evaluation corresponding to any non -basic variable is zero, it is an indication of the
existence of an ______________.
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
42. The right hand side constant of a constraint in a primal problem appears in the corresponding
dual as______________.
43. During iteration while moving from one solution to the next, degeneracy may occur
when______________
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
A. pre-emptive or non-pre-emptive
B. limited
C. unlimited
D. finite
STUDY MATERIAL SEM VI TYBMS
49. The minimum number of lines covering all zeros in a reduced cost matrix of order n can be
______________.
A. at the most n
B. at the least n
C. n-1
D. n+1
50. For a 2.5% increase in order quantity (under fundamental EOQ problem) the total relevant
cost would ______________
STUDY MATERIAL SEM VI TYBMS
A. increase by 2.5%.
B. decrease by 2.5%.
C. increase by 0.25%.
D. decrease by 0.25%.
51. In the basic EOQ model, if the lead time increases from 2 to 4 days, the EOQ will
______________
A. double increase
B. remain constant
C. but not double
D. decrease by a factor of two
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 ______________.
A. two-person game
B. two-person zero-sum game
C. zero-sum game
D. non-zero-sum game
53. In the network, one activity may connect any ______________ nodes
A. 1
B. 2
C. 3
D. 4
A. Simplex Method
B. Dual Simplex Method
C. Big-M Method
D. Search-Approach Method
STUDY MATERIAL SEM VI TYBMS
55. If the given Linear Programming Problem is in its standard form then primal-dual pair is
______________.
A. symmetric
B. un symmetric
C. square
D. triangle
56. The method used to solve Linear Programming Problem without use of the artificial variable
is called ______________.
A. Simplex Method
B. Big-M Method
C. Dual Simplex Method
D. Graphical Mehtod
57. When the total demand is equal to supply then the transportation problem is said to be
______________
A. balanced
B. unbalanced
C. maximization
D. minimization
58. For finding an optimum solution in transportation problem ______________ method is used.
A. Simplex
B. Big-M
C. Modi
D. Hungarian
A. optimal value
B. approximate value
C. initial value
D. infeasible value
60. Any solution to a Linear Programming Problem which also satisfies the non- negative
notifications of the problem has ______________.
A. solution
B. basic solution
C. basic feasible solution
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?
A. E(n) = 2 customers
B. E(m) = 4/3 customers
C. E(v) = 6 minutes
D. E(w) = 16 minutes
A. critical time
STUDY MATERIAL SEM VI TYBMS
B. normal time
C. cost slope
D. crash duration
A. 0
B. 1
C. 2
D. -1
65. Linear Programming Problem that can be solved by graphical method has ______________.
A. linear constraints
B. quadratic constraints
C. non linear constraints
D. bi-quadratic constraints
66. If one or more variable vanish then a basic solution to the system is called ______________.
A. Simplex Method
B. Big-M Method
C. Dual Simplex Method
D. Graphical Mehtod
STUDY MATERIAL SEM VI TYBMS
A. erlang distribution
B. poisson distribution
C. exponential distribution
D. traffic intensity
69. In a transportation table, an ordered set of______________ or more cells is said to form a
loop
A. 2
B. 3
C. 4
D. 5
A. 1
B. 2
C. more than 1
D. more than 2
71. An n-tuple of real numbers which satisfies the constraints of Linear Programming Problem is
called ______________
A. solution
B. basic solution
C. basic feasible solution
D. feasible solution
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
______________.
A. basic solution
B. non basic solution
C. degenerate
D. non degenerate
74. The model in which only arrivals are counted and no departure takes place are called
______________.
75. ______________ of a queuing system is the state where the probability of the number of
customers in the system depends upon time
76. The initial event which has all outgoing arrows with no incoming arrow is numbered
______________.
A. 0
STUDY MATERIAL SEM VI TYBMS
B. 1
C. -1
D. 2
A. arrow
B. straight line
C. curve
D. circle
78. An ______________ represent the start or completion of some activity and as such it
consumes no time
A. activity
B. event
C. slack
D. path
A. Queue
B. Replacement
C. CPM
D. PERT
80. The assignment problem will have alternate solutions when the total opportunity cost matrix
has ______________
81. The region common to all the constraints including the non-negativity restrictions is called
the ______________.
A. solution space
B. unique solution
C. optimum solution
D. infeasible solution
82. A activity in a network diagram is said to be ______________ if the delay in its start will
further delay the project completion time.
A. forward pass
B. backward pass
C. critical.
D. non-critical.
A. physical model.
B. mathematical model.
C. iconic model.
D. descriptive model.
85. If an artificial variable is present in the basic variable column of optimal simplex table, then
the problem has ______________ solution.
A. alternative
STUDY MATERIAL SEM VI TYBMS
B. no solution
C. bounded
D. infeasible
87. Which of the following methods is used to verify the optimality of the current solution of the
transportation problem______________.
88. For a salesman who has to visit n cities, following are the ways of his tour plan
______________.
A. n!
B. (n+a)!
C. (n-a)!
D. n
90. The problem of replacement is felt when job performing units fail ______________.
A. total float
B. free float
C. independent float
D. variance of each float
92. The difference between free float and tail event slack is ______________
A. total float
B. independent float
C. interference float
D. slack
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.
A. 6
B. 8
C. 10
D. 12
95. The time between the placement of an order and its delivery is called as ______________
A. buffer time
B. lead time
C. Economic Order Quantity
D. capital time
96. In Program Evaluation Review Technique the maximum time that is required to perform the
activity under extremely bad conditions is known as ______________.
A. normal time
B. optimistic time
C. most likely time
D. pessimistic time
97. All of the following may be used to find the EOQ except ______________.
98. A feasible solution of an Linear Programming Problem that optimizes the objective function
is called ______________
STUDY MATERIAL SEM VI TYBMS
A. Simplex Method
B. Dual Simplex Method
C. Big-M Method
D. Graphical Method
100. If the given Linear Programming Problem is in its canonical form then primal-dual pair is
______________.
A. symmetric
B. un symmetric
C. square
D. non square
A. square
B. rectangle
C. diagonal
D. triangle
A. occupied
B. unoccupied
C. no
D. finite
STUDY MATERIAL SEM VI TYBMS
A. Transportation Problem
B. Assignment Problem
C. Travelling salesman problem
D. Replacement Problem
A. injective
B. surjective
C. bijective
D. optimal
105. The coefficient of an artificial variable in the objective function of penalty method are
always assumed to be ______________.
A. 0
B. 1
C. M
D. -M
106. The process that performs the services to the customer is known as ______________.
A. queue
B. service channel
C. customers
D. server
107. A queuing system is said to be a ______________ when its operating characteristic are
dependent upon time
STUDY MATERIAL SEM VI TYBMS
A. float
B. event
C. activity
D. path
109. What type of distribution does a time follow in program evaluation review technique
model?
A. Poisson
B. Exponential
C. Normal
D. Chi Square
110. A activity in a network diagram is said to be ______________ if the delay in its start will
further delay the project completion time.
A. critical
B. critical path
C. crash
D. non critical
114. Graphical method of linear programming is useful when the number of decision variable are
______________.
A. 1
B. 2
C. 3
D. 4
A. alternative solution
B. bounded solution
C. infeasible solution
D. unbounded solution
116. If primal linear programming problem has a finite solution, then dual linear programming
problem should ______________.
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______________.
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 ______________
A. half of EOQ
B. one third of EOQ
C. one fourth of EOQ
D. 0.707 time EOQ
A. total demand and total supply are equal and the number of sources equals the number of
destinations.
B. none of the routes is prohibited
C. total demand equals total supply irrespective of the number of sources and destinations
D. number of sources matches with number of destinations
122. In an assignment problem involving 5 workers and 5 jobs, total number of assignments
possible are ______________.
A. 5
B. 10
C. 15
D. 20
123. All of the following are assumptions of the EOQ model except ______________
A. E(n)
B. E(m)
C. E(v)
D. E(w)
125. Graphical method of linear programming is useful when the number of decision variable are
______________
A. 2
STUDY MATERIAL SEM VI TYBMS
B. 3
C. 4
D. 5
A. 0
B. 1
C. 2
D. -1
A. dual-primal
B. primal-dual
C. dual
D. primal
128. Solution of a Linear Programming Problem when permitted to be infinitely large is called
______________.
A. unbounded
B. bounded
C. optimum solution
D. no solution
129. When the total demand is not equal to supply then it is said to be ______________.
A. balanced
B. unbalanced
C. maximization
D. minimization
A. 1
B. 2
C. 3
D. 4
131. If the primal has an unbound objective function value then the dual has ______________.
A. solution
B. basic solution
C. basic feasible solution
D. no feasible solution
A. bounded
B. unbounded
C. no solution
D. alternative solution
A. arrow
B. straight line
C. curve
D. arc
A. activities
B. floats
C. events
D. paths
STUDY MATERIAL SEM VI TYBMS
136. The penalty for not taking correct decision is known as ______________.
A. fine
B. loss
C. cost
D. opportunity cost
137. In a given system of m simultaneous linear equations in n unknowns (m<n) there will be
______________.
A. n basic variables
B. m basic variables
C. (n-m) basic variables
D. (n+m) basic variables
138. If all aij values in the entering variable column of the simplex table are negative, then
______________.
A. solution is unbounded
B. solution is degenerate
C. there exist no solution
D. there are multiple solutions
140. 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. n
C. n+1
D. n-2
142. The group replacement policy is suitable for identical low cost items which are likely to
______________.
A. fail suddenly
B. fail completely and suddenly
C. fail over a period of time
D. be progressive and retrogressive
A. an assignment problem may require the introduction of both dummy row and dummy
column
STUDY MATERIAL SEM VI TYBMS
B. an assignment problem with m rows and n columns will involves a total of m x n possible
assignments
C. an unbalanced assignment is one where the number of rows is more than, or less than the
number of columns
D. balancing any unbalanced assignment problem involves adding one dummy row or
column
145. Which of the following is not a part of holding (or carrying) costs?
146. The area bounded by all the given constraints is called ______________.
A. feasible region
B. basic solution
C. non feasible region
D. optimum basic feasible solution
A. 3465
B. 3750
C. 3500
STUDY MATERIAL SEM VI TYBMS
D. 4000
148. Given arrival rate = 15/hr, service rate = 20/hr, the value of traffic intensity is
______________.
A. 3/4
B. 4/3
C. 3/5
D. 4/5
A. total
B. free
C. independent
D. interference
A. Queue
B. Replacement
C. CPM
D. PERT
151. __________ 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
STUDY MATERIAL SEM VI TYBMS
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
A. Conducting experiments on it
B. Mathematical analysis
C. Both A and B
D. Diversified Techniques
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
STUDY MATERIAL SEM VI TYBMS
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 __________.
A. 1; 1
B. Infinity; infinity
C. 0; 0
D. 1000; 1000
E. -1; -1
157. 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
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?
160. During an iteration while moving from one solution to the next, degeneracy may occur
when
A. Only constraints
B. only non-negative restriction
C. [a] and [b] both
D. [a],[b] and Optimum solution
A. A transportation problem
B. A travelling salesman problem
C. A LP problem
D. Both a & b
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. A triangle
B. A rectangle
C. An unbounded region
D. An empty region
165. 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
166. 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
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:
A. Unbalanced.
B. Infeasible.
C. Optimal.
D. impossible.
E. Degenerate.
A. Profit
B. optimization
C. cost
D. None of the above
169. In case of an unbalanced problem, shipping cost coefficients of __________ are assigned to
each created dummy factory or warehouse.
A. increases infinitely
B. basic variables are nonzero
C. decreases infinitely
D. One or more basic variables are zero
A. payoff.
B. penalty.
C. reward.
D. end-game strategy.
A. 2
B. not more than 3
STUDY MATERIAL SEM VI TYBMS
C. 3
D. none of the above
A. Solution
B. basic solution
C. feasible solution
D. optimal
A. mathematical models
B. physical models diagrammatic
C. diagrammatic models
D. all of above
177. 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
A. Suitable manpower
B. mathematical techniques, models, and tools
C. Financial operations
D. all of above
179. 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
D. all of above
180. 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
181. 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
A. Personnel factors.
B. Financial factors
C. Numeric and quantifiable factors.
D. all of above
A. Scientists
B. Mathematicians
C. Academics
D. All of the above
185. OR techniques help the directing authority in optimum allocation of various limited
resources like __________
A. Policies
B. Actions
C. Both A and B
D. None of the above
STUDY MATERIAL SEM VI TYBMS
190. The initial solution of a transportation problem can be obtained by applying any known
method. However, the only condition is that
191. The large negative opportunity cost value in an unused cell in a transportation table is
chosen to improve the current solution because
192. The method of finding an initial solution based upon opportunity costs is called
__________.
193. 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
194. The objective function and constraints are functions of two types of variables, __________
variables and __________ variables.
A. d(2,-5,3)
B. d(-2,5,-3)
C. d(2,5,3)
D. d(-2,-5,-3)
196. The occurrence of degeneracy while solving a transportation problem means that
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.
198. 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
D. None of the above
199. 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
202. The smallest quantity is chosen at the corners of the closed path with negative sign to be
assigned at unused cell because
203. 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
STUDY MATERIAL SEM VI TYBMS
D. m+n+1
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.
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?
A. Programme Evaluation
B. Review Technique (PERT)
C. Both A and B
D. Deployment of resources
206. 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
D. None of the above
207. 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
STUDY MATERIAL SEM VI TYBMS
D. The transportation problems are formulated in terms of tableaus, while the minimal cost
network flows are formulated in terms of graphs
209. When total supply is equal to total demand in a transportation problem, the problem is said
to be
A. Balanced
B. Unbalanced
C. Degenerate
D. None of the above
210. 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
211. 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
STUDY MATERIAL SEM VI TYBMS
A. Formulating a problem
B. Constructing a model
C. Establishing controls
D. Controlling the environment
213. 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
E. none of the above
214. Which of the following methods is used to verify the optimality of the current solution of
the transportation problem
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
STUDY MATERIAL SEM VI TYBMS
217. 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
219. With the transportation technique, the initial solution can be generated in any fashion one
chooses. The only restriction is that